ACO-MTS: A new approach for multiprocessor task scheduling based on ant colony optimization

In this paper, a new proposed approach named ACO-MTS to multiprocessor task scheduling based on ant colony optimization is introduced. Optimized task scheduling is one of the most important problems in parallel and distributed systems. Task scheduling in multiprocessor architectures is NP-hard so that finding the best possible solution is generally impossible. Ant colony optimization is a metaheuristic approach inspired from social behavior of real ants. It is a multi-agent approach, in which agents (artificial ants) try to find the shortest path for solving the given problem using an indirect communication. The proposed ACO-MTS is evaluated in comparison with not only the traditional heuristics but also the genetic algorithm. Finally, it outperforms the heuristic approaches, and had identical performance with genetic algorithm. However, the genetic algorithm examines too more solutions to achieve the best scheduling compared to ACO-MTS. Presented results demonstrate that the proposed approach is so successful in multiprocessor task scheduling.

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

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

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

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

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

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

[7]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

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

[9]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[25]  Gianni A. Di Caro,et al.  AntNet: A Mobile Agents Approach to Adaptive Routing , 1999 .

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

[27]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[28]  Alain Hertz,et al.  Ants can colour graphs , 1997 .

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

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

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

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

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

[34]  Luca Maria Gambardella,et al.  HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem , 1997 .

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

[36]  M. Dorigo,et al.  1 Positive Feedback as a Search Strategy , 1991 .