Scheduling jobs in the cloud using on-demand and reserved instances

N/ACitations
Citations of this article
33Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Deploying applications in leased cloud infrastructure is increasingly considered by a variety of business and service integrators. However, the challenge of selecting the leasing strategy - larger or faster instances? on-demand or reserved instances? etc.- and to configure the leasing strategy with appropriate scheduling policies is still daunting for the (potential) cloud user. In this work, we investigate leasing strategies and their policies from a broker's perspective. We propose, CoH, a family of Cloud-based, online, Hybrid scheduling policies that minimizes rental cost by making use of both on-demand and reserved instances. We formulate the resource provisioning and job allocation policies as Integer Programming problems. As the policies need to be executed online, we limit the time to explore the optimal solution of the integer program, and compare the obtained solution with various heuristics-based policies; then automatically pick the best one. We show, via simulation and using multiple real-world traces, that the hybrid leasing policy can obtain significantly lower cost than typical heuristics-based policies. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Shen, S., Deng, K., Iosup, A., & Epema, D. (2013). Scheduling jobs in the cloud using on-demand and reserved instances. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8097 LNCS, pp. 242–254). https://doi.org/10.1007/978-3-642-40047-6_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free