Applying cellular automata in multiprocessor scheduling

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.