Scheduling Algorithms Based on Resource Fragmentation for Advance Reservation Tasks

Advance reservation is an important method to guarantee the quality of service in Grid-like distributed systems. However, reserved jobs will make resource into fragments and decrease utilization. In order to minimize the negative effects of advance reservations, the authors analyzed the generation of resource fragments during reservation and investigated their influence on advance reservation requests in a quantitative way. Based on the quantification, two new scheduling algorithms, Resource Fragment-aware Best Fit (FSB) and Resource Fragment-aware Worst Fit (FSW), were proposed and their performances were investigated via comprehensive simulations. In simulation, mean job size, deadline factor, system load and sever number were chosen as control factors, and the performances of the algorithms were analyzed in terms of job acceptance rate, resource utilization and slowdown. We also compared FSB and FSW with Best Fit, First Fit, Min_LIP and Min_TIP. The simulations show that FSW and FSB can provide higher job acceptance rate, especially under heavy system load.

[1]  Dror G. Feitelson,et al.  Backfilling with lookahead to optimize the packing of parallel jobs , 2005, J. Parallel Distributed Comput..

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

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

[4]  Yoshio Tanaka,et al.  An Advance Reservation-Based Co-allocation Algorithm for Distributed Computers and Network Bandwidth on QoS-Guaranteed Grids , 2010, JSSPP.

[5]  Uwe Schwiegelshohn,et al.  On Advantages of Grid Computing for Parallel Job Scheduling , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).

[6]  George N. Rouskas,et al.  Online algorithms for advance resource reservations , 2011, J. Parallel Distributed Comput..

[7]  Sumit Naiksatam,et al.  Elastic reservations for efficient bandwidth utilization in LambdaGrids , 2007, Future Gener. Comput. Syst..

[8]  Klara Nahrstedt,et al.  A distributed resource management architecture that supports advance reservations and co-allocation , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

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

[10]  George N. Rouskas,et al.  Resource co-allocation for large-scale distributed environments , 2009, HPDC '09.

[11]  Dick H. J. Epema,et al.  On the benefit of processor coallocation in multicluster grid systems , 2010 .

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

[13]  Tian Zhihong,et al.  Multi-Cluster Co-Allocation Scheduling Algorithms in Virtual Computing Environment , 2007 .