Efficient scheduling of tasks without full use of processor resources
- 30 September 1980
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 12 (1) , 1-17
- https://doi.org/10.1016/0304-3975(80)90002-x
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Algorithms for Scheduling Tasks on Unrelated ProcessorsJournal of the ACM, 1981
- An Analysis of Preemptive Multiprocessor Job SchedulingMathematics of Operations Research, 1980
- Bounds on the Scheduling of Typed Task SystemsSIAM Journal on Computing, 1980
- Performance analysis of multiprocessor systems containing functionally dedicated processorsActa Informatica, 1978
- Bounds for LPT Schedules on Uniform ProcessorsSIAM Journal on Computing, 1977
- A Level Algorithm for Preemptive SchedulingJournal of the ACM, 1977
- Exact and Approximate Algorithms for Scheduling Nonidentical ProcessorsJournal of the ACM, 1976
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor SystemsJournal of the ACM, 1970
- Optimal Preemptive Scheduling on Two-Processor SystemsIEEE Transactions on Computers, 1969
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969