On-line scheduling of real-time tasks
- 1 January 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 41 (10) , 1326-1331
- https://doi.org/10.1109/12.166609
Abstract
An optimal on-line scheduler is given for a set of real-time tasks with one common deadline on m processors. It is shown that no optimal scheduler can exist for tasks with two distinct deadlines. Finally, an optimal on-line scheduler is given for situations where processors can go down unexpectedly.Keywords
This publication has 8 references indexed in Scilit:
- Preemptive scheduling with release times and deadlinesReal-Time Systems, 1989
- Preemptive Scheduling with Due DatesOperations Research, 1979
- Nearly on Line Scheduling of a Uniform Processor System with Release TimesSIAM Journal on Computing, 1979
- Preemptive Scheduling of Uniform Processor SystemsJournal of the ACM, 1978
- A Level Algorithm for Preemptive SchedulingJournal of the ACM, 1977
- Some simple scheduling algorithmsNaval Research Logistics Quarterly, 1974
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973
- Scheduling with Deadlines and Loss FunctionsManagement Science, 1959