Applying cellular automata in multiprocessor scheduling

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 accor...

Full description

Saved in:
Bibliographic Details
Main Authors: Swiecicka, A., Seredynski, F.
Format: Conference Proceeding
Language:English
Subjects:
Computational efficiency
Computer science
Concurrent computing
Content addressable storage
Costs
Delay
Information technology
Multiprocessing systems
Processor scheduling
Scheduling algorithm
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/PCEE.2002.1115234