دانلود مقاله ISI انگلیسی شماره 79274
عنوان فارسی مقاله

الگوریتم های زمان بندی گردش کار مهلت محدود برای زیرساخت به عنوان یک ابرهای خدمات

کد مقاله سال انتشار مقاله انگلیسی ترجمه فارسی تعداد کلمات
79274 2013 12 صفحه PDF سفارش دهید محاسبه نشده
خرید مقاله
پس از پرداخت، فوراً می توانید مقاله را دانلود فرمایید.
عنوان انگلیسی
Deadline-constrained workflow scheduling algorithms for Infrastructure as a Service Clouds
منبع

Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)

Journal : Future Generation Computer Systems, Volume 29, Issue 1, January 2013, Pages 158–169

کلمات کلیدی
رایانش ابری؛ ابرهای IaaS ؛ محاسبات شبکه؛ زمانبندی گردش کار؛ زمانبندی بر اساس QoS
پیش نمایش مقاله
پیش نمایش مقاله الگوریتم های زمان بندی گردش کار مهلت محدود برای زیرساخت به عنوان یک ابرهای خدمات

چکیده انگلیسی

The advent of Cloud computing as a new model of service provisioning in distributed systems encourages researchers to investigate its benefits and drawbacks on executing scientific applications such as workflows. One of the most challenging problems in Clouds is workflow scheduling, i.e., the problem of satisfying the QoS requirements of the user as well as minimizing the cost of workflow execution. We have previously designed and analyzed a two-phase scheduling algorithm for utility Grids, called Partial Critical Paths (PCP), which aims to minimize the cost of workflow execution while meeting a user-defined deadline. However, we believe Clouds are different from utility Grids in three ways: on-demand resource provisioning, homogeneous networks, and the pay-as-you-go pricing model. In this paper, we adapt the PCP algorithm for the Cloud environment and propose two workflow scheduling algorithms: a one-phase algorithm which is called IaaS Cloud Partial Critical Paths (IC-PCP), and a two-phase algorithm which is called IaaS Cloud Partial Critical Paths with Deadline Distribution (IC-PCPD2). Both algorithms have a polynomial time complexity which make them suitable options for scheduling large workflows. The simulation results show that both algorithms have a promising performance, with IC-PCP performing better than IC-PCPD2 in most cases.

خرید مقاله
پس از پرداخت، فوراً می توانید مقاله را دانلود فرمایید.