Scheduling in and out forests in the presence of communication delays

We consider the problem of scheduling tasks on multiprocessor architectures in the presence of communication delays. Given a set of dependent tasks, the scheduling problem is to allocate the tasks to processors such that the pre-specified precedence constraints among the tasks are obeyed and certain...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on parallel and distributed systems 1996-10, Vol.7 (10), p.1065-1074
Hauptverfasser:	Varvarigou, T.A., Roychowdhury, V.P., Kallath, T., Lawler, E.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer architecture Computer science control theory systems Computer systems and distributed systems. User interface Delay effects Exact sciences and technology Message passing Multiprocessing systems Optimal scheduling Polynomials Processor scheduling Scheduling algorithm Software Theoretical computing
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!