A New Heuristic Approach for Scheduling Independent Tasks on Heterogeneous Computing Systems

Scheduling is one of the core steps to efficiently exploit the capabilities of heterogeneous computing systems. The problem of mapping meta-tasks to a machine is shown to be NP-complete. The NP-complete problem can be solved only using heuristic approach. There are a number of heuristic algorithms that were tailored to deal with scheduling of independent tasks. Different criteria can be used for evaluating the efficiency of scheduling algorithms. The most important of them are makespan, flowtime and resource utilization. In this paper, a new heuristic algorithm for scheduling meta-tasks in heterogeneous computing system is presented. The proposed algorithm improves the performance in both makespan and effective utilization of resources by reducing the idle time of the machine. The performance analyses show that the proposed algorithm has a better resource utilization rate and reduced makespan than the other known algorithms.

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

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

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

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

[5]  Roberto Vaccaro,et al.  Improving search by incorporating evolution principles in parallel Tabu Search , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[6]  Torben Hagerup,et al.  Allocating Independent Tasks to Parallel Processors: An Experimental Study , 1996, J. Parallel Distributed Comput..

[7]  R. F. Freund,et al.  Guest Editor's Introduction: Heterogeneous Processing , 1993 .

[8]  HagerupTorben Allocating Independent Tasks to Parallel Processors , 1997 .

[9]  Hao Chen,et al.  Parallel Genetic Simulated Annealing: A Massively Parallel SIMD Algorithm , 1998, IEEE Trans. Parallel Distributed Syst..

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

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

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

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

[14]  Zhen Li,et al.  Design of Grid Resource Management System Based on Divided Min-Min Scheduling Algorithm , 2009, 2009 First International Workshop on Education Technology and Computer Science.

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

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

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

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

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

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

[21]  Paolo Palazzari,et al.  Real time pipelined system design through simulated annealing , 1996, J. Syst. Archit..

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