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

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Swiecicka, A., Seredynski, F.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Computational efficiency Computer science Concurrent computing Content addressable storage Costs Delay Information technology Multiprocessing systems Processor scheduling Scheduling algorithm
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!