Please use this identifier to cite or link to this item:
|Title:||ScaleStar: Budget conscious scheduling precedence-constrained many-task workflow applications in cloud|
|Authors:||Zeng, L. |
|Citation:||Zeng, L., Veeravalli, B., Li, X. (2012). ScaleStar: Budget conscious scheduling precedence-constrained many-task workflow applications in cloud. Proceedings - International Conference on Advanced Information Networking and Applications, AINA : 534-541. ScholarBank@NUS Repository. https://doi.org/10.1109/AINA.2012.12|
|Abstract:||Traditionally, the "best effort, cost free" model of Supercomputers/Grids does not consider pricing. Clouds have progressed towards a service-oriented paradigm that enables a new way of service provisioning based on "pay-as-you-go" model. Large scale many-task workflow (MTW) may be suited for execution on Clouds due to its scale-* requirement (scale up, scale out, and scale down). In the context of scheduling, MTW execution cost must be considered based on users' budget constraints. In this paper, we address the problem of scheduling MTW on Clouds and present a budget-conscious scheduling algorithm, referred to as Scale Star (or Scale-*). Scale Star assigns the selected task to a virtual machine with higher comparative advantage which effectively balances the execution time-and-monetary cost goals. In addition, according to the actual charging model, an adjustment policy, refer to as DeSlack, is proposed to remove part of slack without adversely affecting the overall make span and the total monetary cost. We evaluate Scale Star with an extensive set of simulations and compare with the most popular HEFT-based LOSS3 algorithm and demonstrate the superior performance of Scale Star. © 2012 IEEE.|
|Source Title:||Proceedings - International Conference on Advanced Information Networking and Applications, AINA|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 12, 2019
WEB OF SCIENCETM
checked on Jan 2, 2019
checked on Oct 6, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.