Multiprocessor scheduling with evolving cellular automata based on ant colony optimization

Multiprocessor scheduling belongs to a special category of NP-complete computational problems. The purpose of scheduling is to scatter tasks among the processors in such a way that the precedence constraints between tasks are kept, and the total execution time is minimized. Cellular automata (CA) can be used for multiprocessor scheduling, but one of the difficulties in using CA is the exponentially increasing number of rules with increasing number of processor and neighborhood radius. Here, we propose a combined use of ant colony and evolutionary meta-heuristics to search the rule's feasible space in order to find optimal rule base. Also we introduce a two dimensional cellular automata structure based on the important task attributes in the precedence task graph. The proposed scheduler that uses evolving cellular automata based on ant colony can find optimal response time for some of well known precedence task graph in the multiprocessor scheduling area.

[1]  Albert Y. Zomaya,et al.  Sequential and Parallel Cellular Automata-Based Scheduling Algorithms , 2002, IEEE Trans. Parallel Distributed Syst..

[2]  Marco Dorigo,et al.  The hyper-cube framework for ant colony optimization , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[3]  Ladislau Bölöni,et al.  A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems , 1999, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99).

[4]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

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

[6]  James P. Crutchfield,et al.  Evolving cellular automata to perform computations , 1997 .

[7]  Jack Dongarra,et al.  Scheduling tasks with precedence constraints on heterogeneous distributed computing systems , 2006 .

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

[9]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[10]  Albert Y. Zomaya,et al.  Multiprocessor scheduling and rescheduling with use of cellular automata and artificial immune system support , 2006, IEEE Transactions on Parallel and Distributed Systems.

[11]  Graham Ritchie,et al.  Static Multi-processor Scheduling with Ant Colony Optimisation & Local Search , 2003 .

[12]  Stephen Wolfram,et al.  Theory and Applications of Cellular Automata , 1986 .

[13]  Tommaso Toffoli,et al.  Cellular automata machines - a new environment for modeling , 1987, MIT Press series in scientific computation.

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