Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems
- 1 August 2006
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 33 (8) , 2155-2177
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- A standard task graph set for fair evaluation of multiprocessor scheduling algorithmsJournal of Scheduling, 2002
- Benchmarking and Comparison of the Task Graph Scheduling AlgorithmsJournal of Parallel and Distributed Computing, 1999
- Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors Using a Parallel Genetic AlgorithmJournal of Parallel and Distributed Computing, 1997
- Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessorsIEEE Transactions on Parallel and Distributed Systems, 1996
- Task scheduling with and without communication delays: A unified approachEuropean Journal of Operational Research, 1996
- Scheduling in and out forests in the presence of communication delaysIEEE Transactions on Parallel and Distributed Systems, 1996
- A Compile-Time Scheduling Heuristic for Multiprocessor ArchitecturesThe Computer Journal, 1996
- Scheduling DAG's for asynchronous multiprocessor executionIEEE Transactions on Parallel and Distributed Systems, 1994
- A note on LPT schedulingOperations Research Letters, 1993
- A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architecturesIEEE Transactions on Parallel and Distributed Systems, 1993