By Topic

Applying cellular automata in multiprocessor scheduling

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Swiecicka, A. ; Dept. of Comput. Sci., Bialystok Univ. of Technol., Poland ; Seredynski, F.

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.

Published in:

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

Date of Conference: