loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Conference on Parallel Computing in Electrical Engineering (PARELEC'02)
Applying Cellular Automata in Multiprocessor Scheduling
Warsaw, Poland
September 22-September 25
ISBN: 0-7695-1730-7
ASCII Text
x 
 
Anna Święcicka, Franciszek Seredyński, "Applying Cellular Automata in Multiprocessor Scheduling," Parallel Computing in Electrical Engineering, International Conference on, pp. 177, International Conference on Parallel Computing in Electrical Engineering (PARELEC'02), 2002.
 
 
BibTex
x
 
@article{ 10.1109/PCEE.2002.1115234,
author = {Anna Święcicka and Franciszek Seredyński},
title = {Applying Cellular Automata in Multiprocessor Scheduling},
journal ={Parallel Computing in Electrical Engineering, International Conference on},
volume = {0},
year = {2002},
isbn = {0-7695-1730-7},
pages = {177},
doi = {http://doi.ieeecomputersociety.org/10.1109/PCEE.2002.1115234},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Computing in Electrical Engineering, International Conference on
TI - Applying Cellular Automata in Multiprocessor Scheduling
SN - 0-7695-1730-7
SP
EP
A1 - Anna Święcicka,
A1 - Franciszek Seredyński,
PY - 2002
KW - null
VL - 0
JA - Parallel Computing in Electrical Engineering, International Conference on
ER -
 
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.
Citation:
Anna Święcicka, Franciszek Seredyński, "Applying Cellular Automata in Multiprocessor Scheduling," parelec, pp.177, International Conference on Parallel Computing in Electrical Engineering (PARELEC'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.