Online algorithms for advance resource reservations

We consider the problem of providing QoS guarantees to Grid users through advance reservation of resources. Advance reservation mechanisms provide the ability to allocate resources to users based on agreed-upon QoS requirements and increase the predictability of a Grid system, yet incorporating such mechanisms into current Grid environments has proven to be a challenging task due to the resulting resource fragmentation. We use concepts from computational geometry to present a framework for tackling the resource fragmentation, and for formulating a suite of scheduling strategies. We also develop efficient implementations of the scheduling algorithms that scale to large Grids. We conduct a comprehensive performance evaluation study using simulation, and we present numerical results to demonstrate that our strategies perform well across several metrics that reflect both user- and system-specific goals. Our main contribution is a timely, practical, and efficient solution to the problem of scheduling resources in emerging on-demand computing environments.

[1]  Chunming Qiao,et al.  Efficient burst scheduling algorithms in optical burst-switched networks using geometric techniques , 2004, IEEE Journal on Selected Areas in Communications.

[2]  R. V. van Nieuwpoort,et al.  The Grid 2: Blueprint for a New Computing Infrastructure , 2003 .

[3]  Marco Spuri,et al.  Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms , 2013 .

[4]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[5]  David Abramson,et al.  Nimrod/G: an architecture for a resource management and scheduling system in a global computational grid , 2000, Proceedings Fourth International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region.

[6]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[7]  Vipin Kumar,et al.  Information power grid: The new frontier in parallel computing? , 1999, IEEE Concurr..

[8]  Krithi Ramamritham,et al.  Scheduling algorithms and operating systems support for real-time systems , 1994, Proc. IEEE.

[9]  Sartaj Sahni,et al.  Nearly On Line Scheduling of a Uniform Processor System with Release Times , 1979, SIAM J. Comput..

[10]  Rajkumar Buyya,et al.  Grid Simulation Infrastructure Supporting Advance Reservation , 2004 .

[11]  Gerhard Fohler,et al.  Efficient scheduling of sporadic, aperiodic, and periodic tasks with complex constraints , 2000, Proceedings 21st IEEE Real-Time Systems Symposium.

[12]  M. Siddiqui,et al.  Grid Capacity Planning with Negotiation-based Advance Reservation for Optimized QoS , 2006, ACM/IEEE SC 2006 Conference (SC'06).

[13]  W. A. Horn.  Some simple scheduling algorithms , 1974 .

[14]  Rajkumar Buyya,et al.  A taxonomy and survey of grid resource management systems for distributed computing , 2002, Softw. Pract. Exp..

[15]  Krithi Ramamritham,et al.  Scheduling Tasks with Resource Requirements in Hard Real-Time Systems , 1987, IEEE Transactions on Software Engineering.

[16]  Eddy Caron,et al.  Deadline scheduling with priority for client-server systems on the grid , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[17]  Mark J. Clement,et al.  Core Algorithms of the Maui Scheduler , 2001, JSSPP.

[18]  Francine Berman,et al.  A study of deadline scheduling for client-server systems on the Computational Grid , 2001, Proceedings 10th IEEE International Symposium on High Performance Distributed Computing.

[19]  Joseph Y.-T. Leung,et al.  Preemptive scheduling with release times and deadlines , 2004, Real-Time Systems.

[20]  Damir Isovic,et al.  Handling sporadic tasks in real-time systems : Combined offline and online approach , 2001 .

[21]  George N. Rouskas,et al.  Efficient QoS Resource Management for Heterogeneous Grids , 2022 .

[22]  Krithi Ramamritham,et al.  Tutorial on hard real-time systems , 1989 .

[23]  Yong Zhao,et al.  Cloud Computing and Grid Computing 360-Degree Compared , 2008, GCE 2008.

[24]  Sartaj Sahni,et al.  Preemptive Scheduling with Due Dates , 1979, Oper. Res..

[25]  Muthucumaru Maheswaran,et al.  SCHEDULING ADVANCE RESERVATIONS WITH PRIORITIES IN GRID COMPUTING SYSTEMS , 2001 .

[26]  Krithi Ramamritham,et al.  Preemptive Scheduling Under Time and Resource Constraints , 1987, IEEE Transactions on Computers.

[27]  Warren Smith,et al.  Scheduling with advanced reservations , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[28]  Marco Spuri,et al.  Deadline Scheduling for Real-Time Systems , 2011 .

[29]  Johan Tordsson,et al.  A Grid Resource Broker Supporting Advance Reservations and Benchmark-Based Resource Selection , 2004, PARA.

[30]  Aloysius K. Mok,et al.  Multiprocessor On-Line Scheduling of Hard-Real-Time Tasks , 1989, IEEE Trans. Software Eng..

[31]  Joseph Y.-T. Leung,et al.  On-line scheduling of real-time tasks , 1988, Proceedings. Real-Time Systems Symposium.

[32]  Kaizar Amin,et al.  Analysis and Provision of QoS for Distributed Grid Applications , 2004, Journal of Grid Computing.

[33]  David Abramson,et al.  The Grid Economy , 2005, Proceedings of the IEEE.

[34]  Jin-Soo Kim,et al.  A dynamic grid services deployment mechanism for on-demand resource provisioning , 2005, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005..

[35]  Zhou Lei,et al.  The portable batch scheduler and the maui scheduler on linux clusters , 2000 .

[36]  Edward M. McCreight,et al.  Priority Search Trees , 1985, SIAM J. Comput..

[37]  Tak Wah Lam,et al.  Non-migratory online deadline scheduling on multiprocessors , 2004, SODA '04.

[38]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[39]  Muthucumaru Maheswaran,et al.  Scheduling Co-Reservations with Priorities in Grid Computing Systems , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).