Analysis, evaluation, and comparison of algorithms for scheduling task graphs on parallel processors

In this paper, we survey algorithms that allocate a parallel program represented by an edge-weighted directed acyclic graph (DAG), also called a task graph or macro-dataflow graph, to a set of homogeneous processors, with the objective of minimizing the completion time. We analyze 21 such algorithms...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings Second International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'96) s. 207 - 213
Hlavní autori:	Ahmad, I., Yu-Kwong Kwok, Min-You Wu
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 1996
Predmet:	Algorithm design and analysis Clustering algorithms Computer science Concurrent computing Network topology Parallel processing Polynomials Processor scheduling Scheduling algorithm Software algorithms
ISBN:	0818674601, 9780818674600
ISSN:	1087-4089
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!