TY - GEN
T1 - Task-based budget distribution strategies for scientific workflows with coarse-grained billing periods in IaaS clouds
AU - Hilman, Muhammad Hafizhuddin
AU - Rodriguez, Maria Alejandra
AU - Buyya, Rajkumar
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/11/14
Y1 - 2017/11/14
N2 - The use of cloud computing, particularly of Infrastructure as a Service clouds, for the execution of largescale scientific workflows has been a topic of interest in recent years. These environments offer on-demand access to all of the infrastructure required for the deployment of workflows, allowing users to pay only for what they use. This leads to schedulers having to find a trade-off between two conflicting quality of service requirements: Time and cost. The majority of research in this area has focused on developing scheduling algorithms that have as objective minimizing the infrastructure cost while meeting a deadline constraint. Few algorithms, however, have addressed the problem of minimizing the execution time of the workflow while meeting a budget constraint. This paper focuses on the latter case. We propose a budget-distribution algorithm that assigns a portion of the overall workflow budget to the individual tasks. This task-level budget then guides the dynamic scheduling process and is continuously refined to reflect any unexpected costs. When compared to the state-of-the-art algorithm, the performance evaluation results demonstrate that in 88% of the cases, our proposal achieves equal or better performance in terms of meeting the budget constraint and achieves lower execution times in 84% of the cases.
AB - The use of cloud computing, particularly of Infrastructure as a Service clouds, for the execution of largescale scientific workflows has been a topic of interest in recent years. These environments offer on-demand access to all of the infrastructure required for the deployment of workflows, allowing users to pay only for what they use. This leads to schedulers having to find a trade-off between two conflicting quality of service requirements: Time and cost. The majority of research in this area has focused on developing scheduling algorithms that have as objective minimizing the infrastructure cost while meeting a deadline constraint. Few algorithms, however, have addressed the problem of minimizing the execution time of the workflow while meeting a budget constraint. This paper focuses on the latter case. We propose a budget-distribution algorithm that assigns a portion of the overall workflow budget to the individual tasks. This task-level budget then guides the dynamic scheduling process and is continuously refined to reflect any unexpected costs. When compared to the state-of-the-art algorithm, the performance evaluation results demonstrate that in 88% of the cases, our proposal achieves equal or better performance in terms of meeting the budget constraint and achieves lower execution times in 84% of the cases.
KW - budget distribution
KW - coarse-grained billing period
KW - scientific workflow
KW - task-based
UR - http://www.scopus.com/inward/record.url?scp=85043761787&partnerID=8YFLogxK
U2 - 10.1109/eScience.2017.25
DO - 10.1109/eScience.2017.25
M3 - Conference contribution
AN - SCOPUS:85043761787
T3 - Proceedings - 13th IEEE International Conference on eScience, eScience 2017
SP - 128
EP - 137
BT - Proceedings - 13th IEEE International Conference on eScience, eScience 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 13th IEEE International Conference on eScience, eScience 2017
Y2 - 24 October 2017 through 27 October 2017
ER -