Deadline-constrained workflow scheduling algorithms for Infrastructure as a Service Clouds

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 proble...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Future generation computer systems Ročník 29; číslo 1; s. 158 - 169
Hlavní autoři: Abrishami, Saeid, Naghibzadeh, Mahmoud, Epema, Dick H.J.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.01.2013
Témata:
Cloud computing
Grid computing
IaaS Clouds
QoS-based scheduling
Workflow scheduling
IaaS Clouds
Cloud computing
Grid computing
QoS-based scheduling
Workflow scheduling
ISSN:0167-739X, 1872-7115
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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. ► We propose two workflow scheduling algorithms for IaaS Clouds. ► The algorithms aim to minimize the workflow execution cost while meeting a deadline. ► The pricing model of the Clouds is considered which is based on a time interval. ► The algorithms are compared with a list heuristic through simulation. ► The experiments show the promising performance of both algorithms.
ISSN:0167-739X
1872-7115
DOI:10.1016/j.future.2012.05.004