Self-managing SLA compliance in cloud architectures: a market-based approach
Proceedings of the 3rd international ACM SIGSOFT symposium on Architecting Critical Systems
Online optimization of busy time on parallel machines
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Task scheduling in budget-constrained cloud computing systems to maximise throughput
International Journal of Computational Science and Engineering
| Hi-index | 0.00 |
We consider the problem of running a large amount of independent equal-sized tasks in the cloud with a budget constraint. We model the cloud infrastructure by a node-weighted edge-weighted star-shaped graph which captures the different computing power and communication capacity of the computing resources in the cloud. Instead of trying to minimize the make span or the total-completion-time of the system, our study focuses on the maximization of the steady-state throughput of the system. We show that the specific budget-constrained steady-state throughput maximization problem can be formulated and solved as a linear programming problem. We identify two modes of the system, i.e., the budget-bound mode and the communication-bound mode where the closed-form solutions exist for the formulated problem. The best allocation scheme is benefit-first when the system is budget-bound, where the preference should be given to the nodes in the order of increasing cost, and is bandwidth-first when the system is communication-bound, where the preference should be given to compute nodes in the order of decreasing bandwidth.