Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing
- 1 November 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-33 (11) , 1023-1029
- https://doi.org/10.1109/tc.1984.1676376
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Combinatorial Problems: Reductibility and ApproximationOperations Research, 1978
- Complexity of Scheduling under Precedence ConstraintsOperations Research, 1978
- A comparison of list schedules for parallel processing systemsCommunications of the ACM, 1974
- Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation ProblemsJournal of the ACM, 1974
- Bounds on the Number of Processors and Time for Multiprocessor Optimal SchedulesIEEE Transactions on Computers, 1973
- Optimal scheduling for two-processor systemsActa Informatica, 1972
- Optimal Scheduling Strategies in a Multiprocessor SystemIEEE Transactions on Computers, 1972
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- Branch-and-Bound Methods: A SurveyOperations Research, 1966
- Parallel Sequencing and Assembly Line ProblemsOperations Research, 1961