Parallel Computing in Electrical Engineering, 2004. International Conference on (2000)
Aug. 27, 2000 to Aug. 30, 2000
Anna Swiecicka , Bialystok University of Technology
Franciszek Seredynski , Polish-Japanese Institute of Information Technologies and Polish Academy of Sciences
In the paper, we propose using cellular automata (CAs) to solve a problem of scheduling tasks of a parallel program in the two-processor system. We examine a hypothesis that a nonlinear structure of a program graph can be approximated by a linear CA structure. Corresponding CAs solving the scheduling problem act according to some rules, which must be found. Searching effective rules is conducted with use of a genetic algorithm (GA). We show that for any initial allocation of tasks, a CA with discovered rules is able to find optimal or near-optimal solutions. Corresponding architecture of a CA is simpler than ones known in the literature.
Anna Swiecicka, Franciszek Seredynski, "Cellular Automata Approach to Scheduling Problem", Parallel Computing in Electrical Engineering, 2004. International Conference on, vol. 00, no. , pp. 29, 2000, doi:10.1109/PCEE.2000.873596