Optimal scheduling algorithm for distributed-memory machines

Task Scheduling is one of the key elements in any distributed-memory machine (DMM), and an efficient algorithm can help reduce the interprocessor communication time. As optimal scheduling of tasks to DMMs is a strong NP-hard problem, many heuristic algorithms have been introduced in the literature....

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on parallel and distributed systems Jg. 9; H. 1; S. 87 - 95
Hauptverfasser:	Darbha, S., Agrawal, D.P.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	IEEE 01.01.1998
Schlagworte:	Communications technology Computational efficiency Cost function Heuristic algorithms NP-hard problem Optimal scheduling Polynomials Processor scheduling Scheduling algorithm Very large scale integration
ISSN:	1045-9219
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!