International Conference on Parallel Computing in Electrical Engineering (PARELEC'02) (2002)
Sept. 22, 2002 to Sept. 25, 2002
Anna Święcicka , Białystok University of Technology
Franciszek Seredyński , Polish-Japanese Institute of Information Technologies and Polish Academy of Sciences
Cellular automata (CAs) are interesting because complex global behaviour arises from simple local interactions. In this paper, CAs are proposed to design parallel scheduling algorithm for allocating tasks of a parallel program in the two processor system. CAs solving the scheduling problem act according to some rules which must be found. Effective rules for CAs are discovered by a genetic algorithm (GA). With these rules, CAs-based scheduler is able to find an allocation which minimizes the total execution time of the program in the two processor system.
F. Seredyński and A. Święcicka, "Applying Cellular Automata in Multiprocessor Scheduling," International Conference on Parallel Computing in Electrical Engineering (PARELEC'02)(PARELEC), Warsaw, Poland, 2002, pp. 177.