On the complexity of list scheduling algorithms for distributed-memory systems
- 1 May 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- A New Approach to Scheduling Parallel Programs Using Task DuplicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1994
- DSC: scheduling parallel tasks on an unbounded number of processorsIEEE Transactions on Parallel and Distributed Systems, 1994
- Analysis and evaluation of heuristic methods for static task schedulingJournal of Parallel and Distributed Computing, 1990
- 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
- Grain size determination for parallel processingIEEE Software, 1988
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969