Abstract
In this paper we propose using cellular automata (CAs) to perform distributed scheduling tasks of a parallel program in the two processor system. We consider a program graph as a CA with elementary cells interacting locally according to a certain rule which must be found. Effective rules for a CA are discovered by a genetic algorithm (GA). With these rules, CA-based scheduler is able to find allocations which minimize the total execution time of the program in the two processor system. We show efficiency of discovered rules in case of modifications of a program graph. These modifications include changing the values of the weights of some randomly chosen tasks or (and) edges of a program graph. We also show that discovered rules may be used to find optimal or suboptimal solutions of other program graphs constructed on the base of a given program graph.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Das, M. Mitchell, J.P. Crutchfield, A Genetic Algorithm Discovers Particle-Based Computation in Cellular Automata, in Y. Davidor, H.-P. Schwefel, R. Männer (eds.), Parallel Problem Solving from Nature — PPSN III, LNCS 866, Springer, 1994, pp. 344 - 353.
F. Seredynski, Discovery with Genetic Algorithm Scheduling Strategies for Cellular Automata, in Parallel Problem Solving from Nature — PPSN V, LNCS 1498, A. E. Eiben, T. Back, M. Schoenauer and H.-P. Schwefel (eds.), Springer, 1998, pp. 643 - 65.
M. Sipper, Evolution of Parallel Cellular Machines, LNCS 1194, Springer, 1997.
A. Swiecicka, F. Seredynski, Evolving Cellular Automata Structures to Solve Multiprocessor Scheduling Problem, Intelligent Information Systems IX, Proceedings of the Workshop held in Bystra, Poland, June 12-16, 2000, pp. 115 - 119.
A. Swi@cicka, F. Seredynski, Cellular Automata Approach to Scheduling Problem, PARELEC 2000 - International Conference on Parallel Computing in Electrical Engineering, Trois-Rivieres, Quebec, Canada, August 27-30, 2000, pp. 29 - 33.
A. Swi@cicka, F. Seredynski, K. Luszczyk, Cellular Automata-Based Multiprocessor Scheduling, PARELEC '98 - International Conference on Parallel Computing in Electrical Engineering, Bialystok, September 2-5, 1998, pp. 264 - 268.
S. Wolfram, Universality and complexity in cellular automata, Physica D, 10, 1984, pp. 1 - 35.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Święcicka, A., Seredyński, F., Jażdżyk, M. (2001). Cellular Automata Approach to Scheduling Problem in Case of Modifications of a Program Graph. In: Kłopotek, M.A., Michalewicz, M., Wierzchoń, S.T. (eds) Intelligent Information Systems 2001. Advances in Intelligent and Soft Computing, vol 10. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1813-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1813-0_14
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-1407-1
Online ISBN: 978-3-7908-1813-0
eBook Packages: Springer Book Archive