Time-discretization for speeding-up scheduling of deadline-constrained workflows in clouds
In this paper we deal with the problem of scheduling workflow applications in multiple infrastructure-as-a-service (IaaS) providers, where the scheduler must determine on which computational resource each component of a workflow should be scheduled in an attempt to minimize the monetary cost of the...
Saved in:
Published in | Future generation computer systems Vol. 107; pp. 1116 - 1129 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
01.06.2020
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In this paper we deal with the problem of scheduling workflow applications in multiple infrastructure-as-a-service (IaaS) providers, where the scheduler must determine on which computational resource each component of a workflow should be scheduled in an attempt to minimize the monetary cost of the workflow execution. In our previous work, we describe the λ-granularity approach that increases the degree of discrete time intervals in an integer linear programming (ILP)to speed up the scheduling of workflow applications with deadline constraints. To assist the selection of a specific discrete time interval (λ value) given a workflow and its deadline, we propose in this paper an aggregate objective function which is derived from historical evaluations of scheduling costs and scheduler runtimes. Results of simulations evince that the proposed AOF-based procedure was able to calculate a specific λ value that allowed the reduction of the ILP-based scheduler running time, although yet achieving cost-effective solutions.
•Presents a workflow scheduler modelled as an integer linear programming (ILP).•Presents the λ-granularity approach that increases the degree of discrete time intervals in the ILP to speed up the production of schedules.•Presents a tool to assist the selection of a specific λ value.•Presents an extensive experimentation via simulation to analyse the balance between the monetary cost of produced schedules, the λ value, and the runtime of the ILP-based scheduler to produce such schedules. |
---|---|
ISSN: | 0167-739X 1872-7115 |
DOI: | 10.1016/j.future.2017.07.061 |