A Comparative Study on Seven Static Mapping Heuristics for Grid Scheduling Problem

Grid computing is a promising technology for future computing platforms and is expected to provide easier access to remote computational resources that are usually locally limited. Scheduling is one of the core steps to efficiently exploit the capabilities of grid computing (GC) systems. The problem of optimally mapping (defined as matching and scheduling) tasks onto the machines of a grid computing environment has been shown, in general, to be NPcomplete, requiring the development of heuristic techniques. The efficient scheduling of independent tasks in a heterogeneous computing environment is an important problem in domains such as grid computing. Different criteria can be used for evaluating the efficiency of scheduling algorithms, the most important of which are makespan, resource utilization and matching proximity. In this paper we will compare 7 popular heuristics for statically mapping independent tasks onto grid computing systems.

[1]  Fatos Xhafa,et al.  Use of genetic algorithms for scheduling jobs in large scale grid applications , 2006 .

[2]  Václav Snásel,et al.  Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments , 2009, 2009 International Joint Conference on Computational Sciences and Optimization.

[3]  R. F. Freund,et al.  Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems , 1999, J. Parallel Distributed Comput..

[4]  Ehsan Ullah Munir,et al.  MaxStd: A Task Scheduling Heuristic for Heterogeneous Computing Environment , 2008 .

[5]  Hui Yan,et al.  An improved ant algorithm for job scheduling in grid computing , 2005, 2005 International Conference on Machine Learning and Cybernetics.

[6]  David Fernández-Baca,et al.  Allocating Modules to Processors in a Distributed System , 1989, IEEE Trans. Software Eng..

[7]  Jian-Zhong Li,et al.  Performance Analysis of Task Scheduling Heuristics in Grid , 2007, 2007 International Conference on Machine Learning and Cybernetics.

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

[9]  Howard Jay Siegel,et al.  Task execution time modeling for heterogeneous computing systems , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[10]  Fatos Xhafa,et al.  Batch mode scheduling in grid systems , 2007, Int. J. Web Grid Serv..

[11]  R. F. Freund,et al.  Scheduling resources in multi-user, heterogeneous, computing environments with SmartNet , 1998, Proceedings Seventh Heterogeneous Computing Workshop (HCW'98).

[12]  Howard Jay Siegel,et al.  High-performance mixed-machine heterogeneous computing , 1998, Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -.

[13]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[14]  Amir Masoud Rahmani,et al.  A Heuristic on Job Scheduling in Grid Computing Environment , 2008, 2008 Seventh International Conference on Grid and Cooperative Computing.

[15]  Fatos Xhafa,et al.  Computational models and heuristic methods for Grid scheduling problems , 2010, Future Gener. Comput. Syst..

[16]  A. A. Maciejewski,et al.  Heterogeneous Computing , 2002 .

[17]  Bin Yao,et al.  A taxonomy for describing matching and scheduling heuristics for mixed-machine heterogeneous computing systems , 1998, Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281).

[18]  Rajkumar Buyya,et al.  Nature's heuristics for scheduling jobs on Computational Grids , 2000 .

[19]  Fatos Xhafa,et al.  Immediate mode scheduling in grid systems , 2007, Int. J. Web Grid Serv..

[20]  Howard Jay Siegel,et al.  Heterogeneous distributed computing: off-line mapping heuristics for independent tasks and for tasks with dependencies, priorities, deadlines, and multiple versions , 2001 .

[21]  Debra A. Hensgen,et al.  The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions , 1998, Proceedings Seventh Heterogeneous Computing Workshop (HCW'98).

[22]  Fatos Xhafa,et al.  Meta-heuristics for Grid Scheduling Problems , 2008 .