On the Design of Online Scheduling Algorithms for Advance Reservations and QoS in Grids

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]  Rajkumar Buyya,et al.  A taxonomy and survey of grid resource management systems for distributed computing , 2002, Softw. Pract. Exp..

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

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

[4]  George N. Rouskas,et al.  Efficient resource management using advance reservations for heterogeneous Grids , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[28]  Joseph Y.-T. Leung,et al.  On-Line Scheduling of Real-Time Tasks , 1992, IEEE Trans. Computers.

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

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

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

[32]  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).

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

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

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

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

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