Multiprocessor Task Graph Scheduling Using a Novel Graph-Like Learning Automata

Optimized task scheduling is one of the most important challenges in multiprocessor environments such as parallel and distributed systems. In such these systems, each parallel program is decomposed into the smaller segments so-called tasks. Task execution times, precedence constrains and communication costs are modeled by using a directed acyclic graph (DAG) named task graph. The goal is to minimize the program finish-time (makespan) by means of mapping the tasks to the processor elements in such a way that precedence constrains are preserved. This problem is shown to be NP-hard in general form and some restricted ones. Therefore, utilization of heuristic and meta-heuristic approaches to solve this problem is logical. Learning automata (LA) is an abstract model to interact with stochastic environment, which tries to reform itself based on the environment feedback. Although a learning automaton itself is a simple component, a group of them by cooperating each other can show complicated behavior, and can coverage to desired solutions under appropriate learning algorithm. In this paper, an ingenious graph-like learning automata in which each task in the task graph is represented by a learning automaton tries to solve the multiprocessor task-scheduling problem in a collective manner. Set of different experiments on various real-world taskgraphs has been done and archived results are so promising compared to the traditional methods and genetic algorithm.

[1]  P. S. Sastry,et al.  Varieties of learning automata: an overview , 2002, IEEE Trans. Syst. Man Cybern. Part B.

[2]  Mayez A. Al-Mouhamed,et al.  Lower Bound on the Number of Processors and Time for Scheduling Precedence Graphs with Communication Costs , 1990, IEEE Trans. Software Eng..

[3]  S. Ranka,et al.  Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors , 1992, Proceedings Supercomputing '92.

[4]  D J Evans,et al.  Parallel processing , 1986 .

[5]  Philippe Chrétienne,et al.  C.P.M. Scheduling with Small Communication Delays and Task Duplication , 1991, Oper. Res..

[6]  Marin Golub,et al.  Scheduling Multiprocessor Tasks with Genetic Algorithms , 2019 .

[7]  Albert Y. Zomaya,et al.  Genetic Scheduling for Parallel Processor Systems: Comparative Studies and Performance Issues , 1999, IEEE Trans. Parallel Distributed Syst..

[8]  Tao Yang,et al.  List Scheduling With and Without Communication Delays , 1993, Parallel Comput..

[9]  B. John Oommen,et al.  Achieving Microaggregation for Secure Statistical Databases Using Fixed-Structure Partitioning-Based Learning Automata , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[10]  Kumpati S. Narendra,et al.  Learning Automata - A Survey , 1974, IEEE Trans. Syst. Man Cybern..

[11]  Mohammad S. Obaidat,et al.  On the use of learning automata in the control of broadcast networks: a methodology , 2002, IEEE Trans. Syst. Man Cybern. Part B.

[12]  Edward A. Lee,et al.  A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures , 1993, IEEE Trans. Parallel Distributed Syst..

[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 Multiprocessing , 1989 .

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

[16]  Elisa Bertino,et al.  PARALLEL AND DISTRIBUTED SYSTEMS , 2010 .

[17]  Jing-Chiou Liou,et al.  Task Clustering and Scheduling for Distributed Memory Parallel Architectures , 1996, IEEE Trans. Parallel Distributed Syst..

[18]  Nirwan Ansari,et al.  A Genetic Algorithm for Multiprocessor Scheduling , 1994, IEEE Trans. Parallel Distributed Syst..

[19]  Frank D. Anger,et al.  Scheduling Precedence Graphs in Systems with Interprocessor Communication Times , 1989, SIAM J. Comput..

[20]  Majid Nili Ahmadabadi,et al.  A Representation for Genetic-Algorithm-Based Multiprocessor Task Scheduling , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[21]  Ishfaq Ahmad,et al.  Benchmarking and Comparison of the Task Graph Scheduling Algorithms , 1999, J. Parallel Distributed Comput..

[22]  Z Liu,et al.  Scheduling Theory and its Applications , 1997 .

[23]  M. Meybodi,et al.  Cellular Learning Automata With Multiple Learning Automata in Each Cell and Its Applications , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[24]  Behrooz Shirazi,et al.  DFRN: a new approach for duplication based scheduling for distributed memory multiprocessor systems , 1997, Proceedings 11th International Parallel Processing Symposium.

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

[26]  B. John Oommen,et al.  Performance evaluation for asynchronous MC-CDMA systems with a symbol timing offset , 2009 .

[27]  Adel Al-maasarani,et al.  Priority-Based Scheduling and Evaluation of Precedence Graphs with Communication Times , 1993 .

[28]  Adel Mohammed Adel Al-Massarani,et al.  Priority-based scheduling and evaluation of precedence graphs with communication times , 1993 .

[29]  Ishfaq Ahmad,et al.  Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors , 1996, IEEE Trans. Parallel Distributed Syst..

[30]  Min-You Wu,et al.  Local search for DAG scheduling and task assignment , 1997, Proceedings of the 1997 International Conference on Parallel Processing (Cat. No.97TB100162).

[31]  Ishfaq Ahmad,et al.  On Exploiting Task Duplication in Parallel Program Scheduling , 1998, IEEE Trans. Parallel Distributed Syst..

[32]  Carolyn McCreary,et al.  Automatic determination of grain size for efficient parallel processing , 1989, CSC '89.

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

[34]  P. Venkata Krishna,et al.  LAID: a learning automata-based scheme for intrusion detection in wireless sensor networks , 2009, Secur. Commun. Networks.

[35]  Ishfaq Ahmad,et al.  On Parallelizing the Multiprocessor Scheduling Problem , 1999, IEEE Trans. Parallel Distributed Syst..

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

[37]  Nirwan Ansari,et al.  Efficient multiprocessor scheduling based on genetic algorithms , 1990, [Proceedings] IECON '90: 16th Annual Conference of IEEE Industrial Electronics Society.

[38]  Janak H. Patel,et al.  The LAST Algorithm: A Heuristic-Based Static Task Allocation Algorithm , 1989, International Conference on Parallel Processing.

[39]  H. R. Boveiri.  ACO-MTS: A new approach for multiprocessor task scheduling based on ant colony optimization , 2010, 2010 International Conference on Intelligent and Advanced Systems.

[40]  Mohammad Reza Meybodi,et al.  Utilizing Distributed Learning Automata to Solve Stochastic Shortest Path Problems , 2006, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

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

[42]  Mihalis Yannakakis,et al.  Scheduling Interval-Ordered Tasks , 1979, SIAM J. Comput..

[43]  M.K. Dhodhi,et al.  A multiprocessor scheduling scheme using problem-space genetic algorithms , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.