Budget constrained execution of multiple Bag-of-Tasks applications on the Cloud
MetadataShow full item record
Optimising the execution of Bag-of-Tasks (BoT) applications on the cloud is a hard problem due to the trade- offs between performance and monetary cost. The problem can be further complicated when multiple BoT applications need to be executed. In this paper, we propose and implement a heuristic algorithm that schedules tasks of multiple applications onto different cloud virtual machines in order to maximise performance while satisfying a given budget constraint. Current approaches are limited in task scheduling since they place a limit on the number of cloud resources that can be employed by the applications. However, in the proposed algorithm there are no such limits, and in comparison with other approaches, the algorithm on average achieves an improved performance of 10%. The experimental results also highlight that the algorithm yields consistent performance even with low budget constraints which cannot be achieved by competing approaches.
Thai , L T , Varghese , B & Barker , A D 2015 , Budget constrained execution of multiple Bag-of-Tasks applications on the Cloud . in 2015 IEEE 8th International Conference on Cloud Computing (CLOUD) . IEEE Computer Society , New York , pp. 975-980 , 8th IEEE International Conference on Cloud Computing (CLOUD 2015) , New York , United States , 27/06/15 . https://doi.org/10.1109/CLOUD.2015.131conference
2015 IEEE 8th International Conference on Cloud Computing (CLOUD)
© 2015. IEEE. This is the accepted manuscript of a conference paper originally submitted to the 8th IEEE International Conference on Cloud Computing
DescriptionThis research is supported by the EPSRC grant ‘Working Together: Constraint Programming and Cloud Computing’ (EP/K015745/1), a Royal Society Industry Fellowship ‘Bringing Science to the Cloud’, an EPSRC Impact Acceleration Grant (IAA) and an Amazon Web Services (AWS) Education Research Grant.
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.