TY - GEN
T1 - A cost-effective scheduling algorithm for scientific workflows in clouds
AU - Zhu, Mengxia
AU - Wu, Qishi
AU - Zhao, Yang
PY - 2012
Y1 - 2012
N2 - Cloud computing enables the delivery of computing, software, storage, and data access through web browsers as a metered service. In addition to commercial applications, an increasing number of large-scale workflow-based scientific applications are being supported by cloud computing. In order to meet the rapidly growing and dynamic computing demands of scientific users, the cloud service provider needs to employ efficient and cost-effective job schedulers to guarantee workflow completion time as well as improve resource utilization for high throughput. Based on rigorous cost models, we formulate a delay-constrained optimization problem to maximize resource utilization and propose a two-step workflow scheduling algorithm to minimize the cloud overhead within a user-specified execution time bound. The extensive simulation results illustrate that our approach consistently achieves lower computing overhead or higher resource utilization than existing methods within the execution time bound. Our approach also significantly reduces the total execution time by strategically selecting appropriate mapping nodes for prioritized modules.
AB - Cloud computing enables the delivery of computing, software, storage, and data access through web browsers as a metered service. In addition to commercial applications, an increasing number of large-scale workflow-based scientific applications are being supported by cloud computing. In order to meet the rapidly growing and dynamic computing demands of scientific users, the cloud service provider needs to employ efficient and cost-effective job schedulers to guarantee workflow completion time as well as improve resource utilization for high throughput. Based on rigorous cost models, we formulate a delay-constrained optimization problem to maximize resource utilization and propose a two-step workflow scheduling algorithm to minimize the cloud overhead within a user-specified execution time bound. The extensive simulation results illustrate that our approach consistently achieves lower computing overhead or higher resource utilization than existing methods within the execution time bound. Our approach also significantly reduces the total execution time by strategically selecting appropriate mapping nodes for prioritized modules.
KW - Scientific workflow
KW - cloud computing
KW - workflow scheduling
UR - http://www.scopus.com/inward/record.url?scp=84874288724&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84874288724&partnerID=8YFLogxK
U2 - 10.1109/PCCC.2012.6407766
DO - 10.1109/PCCC.2012.6407766
M3 - Conference contribution
AN - SCOPUS:84874288724
SN - 9781467348812
T3 - 2012 IEEE 31st International Performance Computing and Communications Conference, IPCCC 2012
SP - 256
EP - 265
BT - 2012 IEEE 31st International Performance Computing and Communications Conference, IPCCC 2012
T2 - 2012 IEEE 31st International Performance Computing and Communications Conference, IPCCC 2012
Y2 - 1 December 2012 through 3 December 2012
ER -