Online Optimization of Busy Time on Parallel Machines - (Extended Abstract)

We consider the following online scheduling problem in which the input consists of n jobs to be scheduled on identical machines of bounded capacity g (the maximum number of jobs that can be processed simultaneously on a single machine). Each job is associated with a release time and a completion time between which it is supposed to be processed. When a job is released, the online algorithm has to make decision without changing it afterwards. We consider two versions of the problem. In the minimization version, the goal is to minimize the total busy time of machines used to schedule all jobs. In the resource allocation maximization version, the goal is to maximize the number of jobs that are scheduled under a budget constraint given in terms of busy time. This is the first study on online algorithms for these problems. We show a rather large lower bound on the competitive ratio for general instances. This motivates us to consider special families of input instances for which we show constant competitive algorithms. Our study has applications in power aware scheduling, cloud computing and optimizing switching cost of optical networks.

[1]  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.

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

[3]  Si Chen,et al.  The regenerator location problem , 2010, Networks.

[4]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[5]  Refael Hassin,et al.  Allocation of bandwidth and storage , 2002 .

[6]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[7]  Ulrich M. Schwarz.  Tightness Results for Malleable Task Scheduling Algorithms , 2007, PPAM.

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

[9]  Gianpiero Monaco,et al.  On the Complexity of the Regenerator Placement Problem in Optical Networks , 2011, IEEE/ACM Transactions on Networking.

[10]  Eugene L. Lawler,et al.  Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.

[11]  Gianpiero Monaco,et al.  Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs , 2008, Euro-Par.

[12]  Thilo Kielmann,et al.  Bag-of-Tasks Scheduling under Budget Constraints , 2010, 2010 IEEE Second International Conference on Cloud Computing Technology and Science.

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

[14]  Reuven Bar-Yehuda,et al.  A unified approach to approximating resource allocation and scheduling , 2001, JACM.

[15]  Randeep Bhatia,et al.  Algorithmic aspects of bandwidth trading , 2003, TALG.

[16]  Bo Hong,et al.  Resource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud , 2010, 2010 IEEE Second International Conference on Cloud Computing Technology and Science.

[17]  Lap-Kei Lee,et al.  Sleep Management on Multiple Machines for Energy and Flow Time , 2011, ICALP.

[18]  Walter Ludwig,et al.  Algorithms for scheduling malleable and nonmalleable parallel tasks , 1996, Technical Report / University of Wisconsin, Madison / Computer Sciences Department.

[19]  Jacques Carlier,et al.  Handbook of Scheduling - Algorithms, Models, and Performance Analysis , 2004 .

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

[21]  D. Atkin.  OR scheduling algorithms. , 2000, Anesthesiology.

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

[23]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[24]  Sanjay Ranka,et al.  Energy-efficient dynamic scheduling on parallel machines , 2008, HiPC'08.

[25]  F. Frances Yao,et al.  A scheduling model for reduced CPU energy , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[26]  Yuval Rabani,et al.  Improved Approximation Algorithms for Resource Allocation , 2002, IPCO.

[27]  John Augustine,et al.  Optimal power-down strategies , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[28]  Kirk Pruhs,et al.  Online scheduling , 2003 .

[29]  Fei Wang,et al.  A Task Scheduling Algorithm Based on Load Balancing in Cloud Computing , 2010, WISM.

[30]  Chaitali Chakrabarti,et al.  Variable voltage task scheduling algorithms for minimizing energy/power , 2003, IEEE Trans. Very Large Scale Integr. Syst..

[31]  Sven Oliver Krumke,et al.  Interval scheduling on related machines , 2011, Comput. Oper. Res..

[32]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[33]  Vincent Salzgeber,et al.  Making cluster applications energy-aware , 2009, ACDC '09.

[34]  Richard J. Lipton,et al.  Online interval scheduling , 1994, SODA '94.

[35]  Elio Salvadori,et al.  A framework for regenerator site selection based on multiple paths , 2010, 2010 Conference on Optical Fiber Communication (OFC/NFOEC), collocated National Fiber Optic Engineers Conference.

[36]  Cynthia A. Phillips,et al.  Off-line admission control for general scheduling problems , 2000, SODA '00.