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

Full description

Bibliographic Details

Published in:	Proceedings : 1997 International Conference on Parallel Architectures and Compilation Techniques : San Francisco, California, November 10-14, 1997 pp. 90 - 101
Main Authors:	Yu-Kwong Kwok, Ahmad, I.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 1997
Subjects:	Application software Computational modeling Concurrent computing Optimal scheduling Parallel algorithms Processor scheduling Prototypes Scheduling algorithm Testing Time factors
ISBN:	0818680903, 9780818680908
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!