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

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings : 1997 International Conference on Parallel Architectures and Compilation Techniques : San Francisco, California, November 10-14, 1997 s. 90 - 101
Hlavní autoři: Yu-Kwong Kwok, Ahmad, I.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1997
Témata:
Application software
Computational modeling
Concurrent computing
Optimal scheduling
Parallel algorithms
Processor scheduling
Prototypes
Scheduling algorithm
Testing
Time factors
ISBN:0818680903, 9780818680908
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 linear-time algorithm works by first generating an initial solution and then refining it using a parallel random search. Using a prototype computer-aided parallelization and scheduling tool called CASCH (Computer-Aided SCHeduling), the algorithm is found to outperform numerous previous algorithms while taking dramatically smaller execution times. The distinctive feature of this research is that, instead of simulations, our proposed algorithm is evaluated and compared with other algorithms using the CASCH tool with real applications running on an Intel Paragon. The PFAST algorithm is also evaluated with randomly generated DAGs for which optimal schedules are known. The algorithm generated optimal solutions for a majority of the test cases and close-to-optimal solutions for the others. The proposed algorithm is the fastest scheduling algorithm known to us and is an attractive choice for scheduling under running time constraints.
ISBN:0818680903
9780818680908
DOI:10.1109/PACT.1997.644006