A parallel algorithm for compile-time scheduling of parallel programs on multiprocessors

Proposes a parallel randomized algorithm, called PFAST (Parallel Fast Assignment using Search Technique), for scheduling parallel programs represented by directed acyclic graphs (DAGs) during compile-time. The PFAST algorithm has O(e) time complexity, where e is the number of edges in the DAG. This...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings : 1997 International Conference on Parallel Architectures and Compilation Techniques : San Francisco, California, November 10-14, 1997 s. 90 - 101
Hlavní autori:	Yu-Kwong Kwok, Ahmad, I.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 1997
Predmet:	Application software Computational modeling Concurrent computing Optimal scheduling Parallel algorithms Processor scheduling Prototypes Scheduling algorithm Testing Time factors
ISBN:	0818680903, 9780818680908
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!