Szczegóły publikacji
Opis bibliograficzny
Algorithms for cost- and deadline-constrained provisioning for scientific workflow ensembles in IaaS clouds / Maciej MALAWSKI, Gideon Juve, Ewa Deelman, Jarek Nabrzyski // Future Generation Computer Systems ; ISSN 0167-739X. — 2015 — vol. 48, s. 1–18. — Bibliogr. s. 16–17, Abstr.
Autorzy (4)
- AGHMalawski Maciej
- Juve Gideon
- Deelman Ewa
- Nabrzyski Jarek
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 88677 |
|---|---|
| Data dodania do BaDAP | 2015-04-15 |
| Tekst źródłowy | URL |
| DOI | 10.1016/j.future.2015.01.004 |
| Rok publikacji | 2015 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Future Generation Computer Systems |
Abstract
Large-scale applications expressed as scientific workflows are often grouped into ensembles of interrelated workflows. In this paper, we address a new and important problem concerning the efficient management of such ensembles under budget and deadline constraints on Infrastructure as a Service (IaaS) clouds. IaaS clouds are characterized by on-demand resource provisioning capabilities and a pay-per-use model. We discuss, develop, and assess novel algorithms based on static and dynamic strategies for both task scheduling and resource provisioning. We perform the evaluation via simulation using a set of scientific workflow ensembles with a broad range of budget and deadline parameters, taking into account task granularity, uncertainties in task runtime estimations, provisioning delays, and failures. We find that the key factor determining the performance of an algorithm is its ability to decide which workflows in an ensemble to admit or reject for execution. Our results show that an admission procedure based on workflow structure and estimates of task runtimes can significantly improve the quality of solutions. (C) 2015 Elsevier B.V. All rights reserved.
