DAG Scheduling on Heterogeneous Distributed Systems Using Learning Automata

DAG scheduling is of great importance to optimal distribution of tasks in parallel and distributed systems. In this paper a novel approach to DAG scheduling, utilizing learning automata across distributed systems, is proposed. The learning process begins with an initial population of randomly generated learning automata. Each automaton 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 learning automata is applied to find the most suitable position for the genes in addition to looking for the best chromosomes. The scheduling resulted from applying our scheduling algorithm to some benchmark task graphs are compared with the existing ones.

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

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

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

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

[5]  Vivek Sarkar,et al.  Partitioning and Scheduling Parallel Programs for Multiprocessing , 1989 .

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

[7]  P. Mars,et al.  Application of Learning Automata to Image Data Compression , 1986 .

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

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

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

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

[12]  Kumpati S. Narendra,et al.  Adaptive and Learning Systems , 1986 .

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

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

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

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