Experimental performance evaluation of job scheduling and processor allocation algorithms for grid computing on metacomputers

Summary form only given. Scheduling is a fundamental issue in achieving high performance on metacomputers and computational grids. The job scheduling problem for grid computing on metacomputers has been studied as a combinatorial optimization problem. In this paper, we compare the performance of various job scheduling and processor allocation algorithms for grid computing on metacomputers. We evaluate the performance of 128 combinations of two job scheduling algorithms, four initial job ordering strategies, four processor allocation algorithms, and four metacomputers by extensive simulation. It is found that the combination of LJF and MEET or LMF yields the best performance, and the choice of FCFS and LS depends on the range of job sizes.

[1]  Andrew S. Grimshaw,et al.  Metasystems , 1998, CACM.

[2]  Uwe Schwiegelshohn,et al.  The NRW-Metacomputer - building blocks for a worldwide computational grid , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[3]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Parallel Distributed Comput. Pract..

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Marco Mililotti,et al.  Scheduling in a grid computing environment using genetic algorithms , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[6]  Jörn Gehring,et al.  Scheduling a Metacomputer with Uncooperative Sub-schedulers , 1999, JSSPP.

[7]  P. Sadayappan,et al.  Distributed job scheduling on computational Grids using multiple simultaneous requests , 2002, Proceedings 11th IEEE International Symposium on High Performance Distributed Computing.

[8]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.

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

[10]  Keqin Li,et al.  Job scheduling for grid computing on metacomputers , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

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

[12]  Axel Keller,et al.  Managing Clusters of Geographically Distributed High-Performance Computers , 1999 .

[13]  L. Smarr,et al.  Metacomputing : Siggraph'92 Showcase , 1992 .

[14]  Keqin Li.  Analysis of an Approximation Algorithm for Scheduling Independent Parallel Tasks , 1999, Discret. Math. Theor. Comput. Sci..

[15]  Andrew S. Grimshaw,et al.  Metasystems: An Approach Combining Parallel Processing and Heterogeneous Distributed Computing Systems , 1994, J. Parallel Distributed Comput..