Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
- 1 October 1975
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 22 (4), 522-550
- https://doi.org/10.1145/321906.321917
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Scheduling independent tasks to reduce mean finishing timeCommunications of the ACM, 1974
- A task-scheduling algorithm for a multiprogramming computer systemPublished by Association for Computing Machinery (ACM) ,1973
- Bounds on scheduling with limited resourcesPublished by Association for Computing Machinery (ACM) ,1973
- Polynomial complete scheduling problemsPublished by Association for Computing Machinery (ACM) ,1973
- Optimal scheduling for two-processor systemsActa Informatica, 1972
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor SystemsJournal of the ACM, 1970
- Optimal Preemptive Scheduling on Two-Processor SystemsIEEE Transactions on Computers, 1969