List scheduling with and without communication delays
- 1 December 1993
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 19 (12) , 1321-1344
- https://doi.org/10.1016/0167-8191(93)90079-z
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessorsJournal of Parallel and Distributed Computing, 1992
- Performance of the Intel iPSC/860 and Ncube 6400 hypercubesParallel Computing, 1991
- Scheduling parallel program tasks onto arbitrary target machinesJournal of Parallel and Distributed Computing, 1990
- Parallel Gaussian elimination on an MIMD computerParallel Computing, 1988
- Practical Multiprocessor Scheduling Algorithms for Efficient Parallel ProcessingIEEE Transactions on Computers, 1984
- On the Mapping ProblemIEEE Transactions on Computers, 1981
- A comparison of list schedules for parallel processing systemsCommunications of the ACM, 1974
- Optimal scheduling for two-processor systemsActa Informatica, 1972
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966
- Parallel Sequencing and Assembly Line ProblemsOperations Research, 1961