Scheduling complete intrees on two uniform processors with communication delays

We present an optimal algorithm for scheduling a complete k-ary tree on two uniform processors of different speeds in order to minimize schedule length. We consider the basic case of unit standard execution times and unit communication times.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information processing letters 1996-06, Vol.58 (5), p.255-263
Hauptverfasser:	Błażewicz, Jacek, Bouvry, Pascal, Guinand, Frédéric, Trystram, Denis
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer science control theory systems Exact sciences and technology Intrees Operational research and scientific management Operational research. Management science Parallel algorithms Parallel processing Parallelism Scheduling Scheduling, sequencing Studies Theoretical computing Uniform processors
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We present an optimal algorithm for scheduling a complete k-ary tree on two uniform processors of different speeds in order to minimize schedule length. We consider the basic case of unit standard execution times and unit communication times.
ISSN:	0020-0190 1872-6119
DOI:	10.1016/0020-0190(96)00062-2