A high performance, low complexity algorithm for compile-time job scheduling in homogeneous computing environments
Authors:
- T. HagrasTHT. Hagras
- J. JanecekJJJ. Janecek
- 2 March 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5, 149-155
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- A comparison of general approaches to multiprocessor scheduling2002
- Benchmarking the task graph scheduling algorithms1998
- Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessorsIEEE Transactions on Parallel and Distributed Systems, 1996
- A New Approach to Scheduling Parallel Programs Using Task Duplication1994
- A Comparison of Multiprocessor Scheduling Heuristics1994
- On the granularity and clustering of directed acyclic task graphsIEEE Transactions on Parallel and Distributed Systems, 1993
- A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architecturesIEEE Transactions on Parallel and Distributed Systems, 1993
- A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessorsJournal of Parallel and Distributed Computing, 1992
- Hypertool: a programming aid for message-passing systemsIEEE Transactions on Parallel and Distributed Systems, 1990
- Scheduling Precedence Graphs in Systems with Interprocessor Communication TimesSIAM Journal on Computing, 1989