On the optimality of minimum laxity and earliest deadline scheduling for real-time multiprocessors
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 15, 17-24
- https://doi.org/10.1109/emwrt.1990.128221
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Analysis of a delay-dependent priority discipline in a multi-class traffic packet switching nodePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Dynamic priority protocols for packet voiceIEEE Journal on Selected Areas in Communications, 1989
- A performance analysis of minimum laxity and earliest deadline scheduling in a real-time systemIEEE Transactions on Computers, 1989
- Optimal scheduling policies for a class of queues with customer deadlines to the beginning of serviceJournal of the ACM, 1988
- Point Processes and QueuesPublished by Springer Nature ,1981
- The Markovian Queue with Bounded Waiting timeManagement Science, 1977
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973
- Optimal Issuing Policies for Perishable InventoryManagement Science, 1972
- Single server queues with restricted accessibilityJournal of Engineering Mathematics, 1969
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late JobsManagement Science, 1968