A hybrid method for task scheduling

Task Graph Scheduling is an NP-Hard problem. In this paper a new hybrid method based on Genetic Algorithm and Learning Automata is proposed. The hybrid method begins with an initial population of randomly generated chromosomes. A chromosome is Equal to learning automaton. Each Chromosome by itself represents a stochastic scheduling. The scheduling is optimized within a learning process. Compared with current genetic approaches to DAG scheduling better results are achieved. The main reason underlying this achievement is that an evolutionary approach such as genetics, looks for the best chromosomes within genetic populations whilst in the approach presented in this paper hybrid algorithm is applied to find the most suitable position for the genes and looking for the best chromosomes too. The scheduling resulted from applying our hybrid algorithm to some benchmark task graphs are compared with the existing ones

[1]  B. John Oommen,et al.  Deterministic Learning Automata Solutions to the Equipartitioning Problem , 1988, IEEE Trans. Computers.

[2]  Kumpati S. Narendra,et al.  Learning automata - an introduction , 1989 .

[3]  Mohammad Reza Meybodi,et al.  A Hybrid Method for Solving Traveling Salesman Problem , 2007, 6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007).

[4]  Ali Hosseinalipour,et al.  DAG Scheduling on Heterogeneous Distributed Systems Using Learning Automata , 2010, ACIIDS.

[5]  Daniel Gajski,et al.  A Programming Aid for Message-passing Systems , 1987, PPSC.

[6]  Kuo-Chi Lin,et al.  An incremental genetic algorithm approach to multiprocessor scheduling , 2004, IEEE Transactions on Parallel and Distributed Systems.

[7]  Nawwaf N. Kharma,et al.  A high performance algorithm for static task scheduling in heterogeneous distributed computing systems , 2008, J. Parallel Distributed Comput..

[8]  Carolyn McCreary,et al.  A comparison of heuristics for scheduling DAGs on multiprocessors , 1994, Proceedings of 8th International Parallel Processing Symposium.

[9]  Kaddour Najim,et al.  Learning automata and stochastic optimization , 1997 .

[10]  Vivek Sarkar,et al.  Partitioning and scheduling parallel programs for execution on multiprocessors , 1987 .

[11]  Y.-K. Kwok,et al.  Static scheduling algorithms for allocating directed task graphs to multiprocessors , 1999, CSUR.

[12]  Mitsuo Gen,et al.  A comparison of multiprocessor task scheduling algorithms with communication costs , 2008, Comput. Oper. Res..

[13]  Daniel Gajski,et al.  Hypertool: A Programming Aid for Message-Passing Systems , 1990, IEEE Trans. Parallel Distributed Syst..

[14]  Albert Y. Zomaya,et al.  Multiprocessor scheduling using mean-field annealing , 1998, Future Gener. Comput. Syst..