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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of parallel and distributed computing Vol. 59; no. 3; pp. 381 - 422
Main Authors:	Kwok, Yu-Kwong, Ahmad, Ishfaq
Format:	Journal Article
Language:	English
Published:	San Diego, CA Elsevier Inc 01.12.1999 Elsevier
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!