Applying cellular automata in multiprocessor scheduling

Author

Swiecicka, Anna ; Seredynski, Franciszek

Author_Institution

Dept. of Comput. Sci., Bialystok Univ. of Technol., Poland

fYear

2002

fDate

2002

Firstpage

177

Lastpage

182

Abstract

Cellular automata (CA) are interesting because complex global behaviour arises from simple local interactions. In this paper, CAs are proposed to design a parallel scheduling algorithm for allocating tasks of a parallel program in the two processor system. CA solving the scheduling problem act according to rules which must be found. Effective rules for CA are discovered by a genetic algorithm (GA). With these rules, a CA-based scheduler is able to find an allocation which minimizes the total execution time of the program in the two processor system.

Keywords

cellular automata; genetic algorithms; parallel algorithms; processor scheduling; resource allocation; cellular automata; complex global behaviour; genetic algorithm; local interactions; minimized total execution time; multiprocessor scheduling; parallel program; parallel scheduling algorithm; task allocation; two processor system; Computational efficiency; Computer science; Concurrent computing; Content addressable storage; Costs; Delay; Information technology; Multiprocessing systems; Processor scheduling; Scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Computing in Electrical Engineering, 2002. PARELEC '02. Proceedings. International Conference on

Print_ISBN

0-7695-1730-7

Type

conf

DOI

10.1109/PCEE.2002.1115234

Filename

1115234