Minimizing total busy time in offline parallel scheduling with application to energy efficiency in cloud computing

Our paper considers the following fundamental scheduling problem. There are n deterministic jobs to be scheduled offline on multiple identical machines, which have bounded capacities. Each job is associated with a start‐time, an end‐time, a process time, and demand for machine capacity. The goal is to schedule all of the jobs non‐preemptively in their start‐time‐end‐time windows, subject to machine capacity constraints such that the total busy time of the machines is minimized. We refer to this problem as minimizing the total busy time for the scheduling of multiple identical machines (MinTBT). This problem has important applications in power‐aware scheduling for Cloud computing, optical network design, customer service systems, and other related areas. Scheduling to minimize busy times is already NP‐hard in the special case where all jobs have the same process time and can be scheduled in a fixed time interval. One best‐known result for this problem is a 5‐approximation algorithm for special instances using first‐fit‐decreasing algorithm. In this paper, we propose and prove a 3‐approximation algorithm, modified first‐fit‐decreasing‐earliest for the general case and obtain more results for special cases. We then show how our results are applied in cloud computing to improve the energy efficiency. Copyright © 2013 John Wiley & Sons, Ltd.

[1]  Wenhong Tian,et al.  A Toolkit for Modeling and Simulation of Real-Time Virtual Machine Allocation in a Cloud Data Center , 2015, IEEE Transactions on Automation Science and Engineering.

[2]  Frits C. R. Spieksma,et al.  Interval scheduling: A survey , 2007 .

[3]  Feng Zhao,et al.  Energy aware consolidation for cloud computing , 2008, CLUSTER 2008.

[4]  Randy H. Katz,et al.  A view of cloud computing , 2010, CACM.

[5]  Edward G. Coffman,et al.  Bin packing with divisible item sizes , 1987, J. Complex..

[6]  Lachlan L. H. Andrew,et al.  Dynamic Right-Sizing for Power-Proportional Data Centers , 2011, IEEE/ACM Transactions on Networking.

[7]  Rajkumar Buyya,et al.  Power‐aware provisioning of virtual machines for real‐time Cloud services , 2011, Concurr. Comput. Pract. Exp..

[8]  Prashant J. Shenoy,et al.  Energy-aware load balancing in content delivery networks , 2011, 2012 Proceedings IEEE INFOCOM.

[9]  Albert Y. Zomaya,et al.  A Taxonomy and Survey of Energy-Efficient Data Centers and Cloud Computing Systems , 2010, Adv. Comput..

[10]  Albert Y. Zomaya,et al.  Energy efficient utilization of resources in cloud computing systems , 2010, The Journal of Supercomputing.

[11]  Gianpiero Monaco,et al.  Minimizing total busy time in parallel scheduling with application to optical networks , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Xue Liu,et al.  Minimizing Electricity Cost: Optimization of Distributed Internet Data Centers in a Multi-Electricity-Market Environment , 2010, 2010 Proceedings IEEE INFOCOM.

[14]  Rajkumar Buyya,et al.  Energy-aware resource allocation heuristics for efficient management of data centers for Cloud computing , 2012, Future Gener. Comput. Syst..

[15]  Prudence W. H. Wong,et al.  Optimizing Busy Time on Parallel Machines , 2012, 2012 IEEE 26th International Parallel and Distributed Processing Symposium.

[16]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[17]  Han Hoogeveen,et al.  Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations , 1994, Discret. Appl. Math..

[18]  Hai Jin,et al.  Performance and energy modeling for live migration of virtual machines , 2011, Cluster Computing.

[19]  Peter Winkler,et al.  Wavelength assignment and generalized interval graph coloring , 2003, SODA '03.

[20]  Baruch Schieber,et al.  Minimizing Busy Time in Multiple Machine Real-time Scheduling , 2010, FSTTCS.

[21]  Yi Zhong,et al.  State-of-the-art research study for green cloud computing , 2011, The Journal of Supercomputing.

[22]  T. C. Edwin Cheng,et al.  Fixed interval scheduling: Models, applications, computational complexity and algorithms , 2007, Eur. J. Oper. Res..