On Effects of Resource Fragmentation on Job Scheduling Performance in Computing Grids

Job scheduling has attracted much research attention in recent years. Various job scheduling methods have been proposed and evaluated under different workload and grid conditions. However, few efforts have been made to analyze the underlying causes that lead to the performance results of the proposed scheduling methods. This paper presents our studies on analysis of job scheduling performance in computing grids from the perspective of resource fragmentation. Two parts of job scheduling will impact on resource fragmentation: job selection and site selection. A series of simulations have been conducted to investigate the effects of resource fragmentation in terms of average waiting time of all jobs. The performance results indicate that resource fragmentation plays an important role on job scheduling performance. Based on the results, good job selection and site selection mechanisms are proposed to form an effective job scheduling method which could reduce resource fragmentation and thus improve system performance, achieving more than five times performance improvement compared to primitive job scheduling methods.

[1]  David A. Lifka,et al.  The ANL/IBM SP Scheduling System , 1995, JSSPP.

[2]  Larry Rudolph,et al.  Parallel Job Scheduling: Issues and Approaches , 1995, JSSPP.

[3]  Dhiraj K. Pradhan,et al.  Processor Allocation in Hypercube Multicomputers: Fast and Efficient Strategies for Cubic and Noncubic Allocation , 1995, IEEE Trans. Parallel Distributed Syst..

[4]  Lionel M. Ni,et al.  Contention-Free 2D-Mesh Cluster Allocation in Hypercubes , 1995, IEEE Trans. Computers.

[5]  Honbo Zhou,et al.  The EASY - LoadLeveler API Project , 1996, JSSPP.

[6]  Jong Kim,et al.  Real-time job scheduling in hypercube systems , 1997, Proceedings of the 1997 International Conference on Parallel Processing (Cat. No.97TB100162).

[7]  Uwe Schwiegelshohn,et al.  Theory and Practice in Parallel Job Scheduling , 1997, JSSPP.

[8]  Kyung-Yong Chwa,et al.  An Algorithm for Scheduling Jobs in Hypercube Systems , 1998, IEEE Trans. Parallel Distributed Syst..

[9]  Ramin Yahyapour,et al.  Design and evaluation of job scheduling strategies for grid computing , 2000, GRID.

[10]  Dror G. Feitelson,et al.  Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling , 2001, IEEE Trans. Parallel Distributed Syst..

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

[12]  Ramin Yahyapour,et al.  Benefits of global grid computing for job scheduling , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.