Communication contention in task scheduling

Task scheduling is an essential aspect of parallel programming. Most heuristics for this NP-hard problem are based on a simple system model that assumes fully connected processors and concurrent interprocessor communication. Hence, contention for communication resources is not considered in task sch...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on parallel and distributed systems Jg. 16; H. 6; S. 503 - 515
Hauptverfasser:	Sinnen, O., Sousa, L.A.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.06.2005 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Communication communication contention Communication networks Communications networks concurrent programming Delay heterogeneous system model Network topology NP-hard problem Parallel processing Parallel programming Processor scheduling Proposals Reflection Routing scheduling and task partitioning Studies
ISSN:	1045-9219, 1558-2183
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!