A DAG Task Scheduling Scheme on Heterogeneous Computing Systems Using Invasive Weed Optimization Algorithm

Efficient task scheduling is crucial to heterogeneous cluster performance. And various scheduling methods based on random search technique have been proposed for both homogeneous and heterogeneous cluster systems. However, most of these methods have high computational overhead and poor convergence. Invasive weed optimization algorithm (IWO) is a novel bionic intelligent optimization algorithm that has fast convergence rate and easier implementation than traditional genetic algorithm (GA) based algorithm. In this paper, an IWO task scheduling (IWOTS) algorithm is proposed for heterogeneous cluster system. To the best of our knowledge, this study is the first time to apply IWO to discrete task scheduling problems. Extensive simulation experiment results show that IWOTS generally exhibits outstanding convergence performance and could produce an optimal scheduling strategy.

[1]  De-fu Zhang,et al.  A Hybrid Genetic Scheduling Algorithm to Heterogeneous Distributed System , 2012 .

[2]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[3]  Kenli Li,et al.  A DAG scheduling scheme on heterogeneous computing systems using double molecular structure-based chemical reaction optimization , 2013, J. Parallel Distributed Comput..

[4]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[5]  C. Lucas,et al.  A novel numerical optimization algorithm inspired from weed colonization , 2006, Ecol. Informatics.

[6]  Hironori Kasahara,et al.  Practical multiprocessor scheduling algorithms for efficient parallel processing , 1985, Systems and Computers in Japan.

[7]  Thomas Hérault,et al.  DAGuE: A Generic Distributed DAG Engine for High Performance Computing , 2011, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum.

[8]  Hironori Kasahara,et al.  Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing , 1984, IEEE Transactions on Computers.

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

[10]  P. Chitra,et al.  Modified genetic algorithm for multiobjective task scheduling on heterogeneous computing system , 2011, Int. J. Inf. Technol. Commun. Convergence.

[11]  James C. Browne,et al.  General approach to mapping of parallel computations upon multiprocessor architectures , 1988 .

[12]  Salim Hariri,et al.  Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing , 2002, IEEE Trans. Parallel Distributed Syst..

[13]  C. V. Ramamoorthy,et al.  Optimal Scheduling Strategies in a Multiprocessor System , 1972, IEEE Transactions on Computers.

[14]  Dong Li,et al.  Implementation of Multi-objective Evolutionary Algorithm for Task Scheduling in Heterogeneous Distributed Systems , 2012, J. Softw..

[15]  C. L. Philip Chen,et al.  Efficient scheduling algorithms for robot inverse dynamics computation on a multiprocessor system , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[16]  K. Mani Chandy,et al.  A comparison of list schedules for parallel processing systems , 1974, Commun. ACM.