Benchmarking and Comparison of the Task Graph Scheduling Algorithms

The problem of scheduling a parallel program represented by a weighted directed acyclic graph (DAG) to a set of homogeneous processors for minimizing the completion time of the program has been extensively studied. The NP-completeness of the problem has stimulated researchers to propose a myriad of...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of parallel and distributed computing Ročník 59; číslo 3; s. 381 - 422
Hlavní autori:	Kwok, Yu-Kwong, Ahmad, Ishfaq
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	San Diego, CA Elsevier Inc 01.12.1999 Elsevier
Predmet:	Applied sciences benchmarks Computer science; control theory; systems Computer systems and distributed systems. User interface Exact sciences and technology multiprocessors parallel processing performance evaluation scalability scheduling Software task graphs performance evaluation scheduling benchmarks multiprocessors parallel processing scalability task graphs Performance evaluation Multiprocessor Parallel program Parallel processing NP complete problem Bench mark Scheduling Algorithm Acyclic graph Directed graph Completion time
ISSN:	0743-7315, 1096-0848
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!