Cutting Your Cloud Computing Cost for Deadline-Constrained Batch Jobs

Many web service providers use commercial cloud computing infrastructures like Amazon for flexible and reliable service deployment. For these web service providers, the cost of cloud computing usage becomes a big part of their IT department cost. Facing the diverse pricing models including on-demand, reserved, and spot instance, it is difficult for web service providers to optimize their cost. This paper introduces a new cloud brokerage service to help web service providers to minimize their cloud computing cost for deadline-constrained batch jobs, which have been a significant workload in web services. Our cloud brokerage service associates each batch job with deadline, and always tries to use cheaper reserved instances for computation to maintain a minimum cost. We achieve this with the following two steps: (1) given a set of jobs' specifications, determine the scheduling of jobs, (2) given the scheduling and pricing options, find an optimal instance renting strategy. We prove that both problems in two steps are computation intractable, and propose approximation algorithms for them. Trace-based evaluation shows that our cloud brokerage service can reduce up to 57% of the cloud computing cost.

[1]  Thomas J. Hacker,et al.  Flexible resource allocation for reliable virtual cluster computing systems , 2011, 2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC).

[2]  Yang Song,et al.  Optimal bidding in spot instance market , 2012, 2012 Proceedings IEEE INFOCOM.

[3]  Baochun Li,et al.  Dynamic Cloud Resource Reservation via Cloud Brokerage , 2013, 2013 IEEE 33rd International Conference on Distributed Computing Systems.

[4]  Miao Pan,et al.  Optimal Resource Rental Planning for Elastic Applications in Cloud Market , 2012, 2012 IEEE 26th International Parallel and Distributed Processing Symposium.

[5]  Timothy M. Chan,et al.  Strip Packing with Slicing , 2012 .

[6]  Ling Liu,et al.  Cura: A Cost-Optimized Model for MapReduce in a Cloud , 2013, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing.

[7]  Pramod Bhatotia,et al.  Orchestrating the Deployment of Computations in the Cloud with Conductor , 2012, NSDI.

[8]  Yang Song,et al.  Optimal Bids for Spot VMs in a Cloud for Deadline Constrained Jobs , 2012, 2012 IEEE Fifth International Conference on Cloud Computing.

[9]  Chor Ping Low An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs , 2006, Inf. Process. Lett..

[10]  Charles U. Martel,et al.  Preemptive Scheduling with Release Times, Deadlines, and Due Times , 1982, JACM.