A performance analysis of minimum laxity and earliest deadline scheduling in a real-time system
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 38 (12) , 1736-1744
- https://doi.org/10.1109/12.40851
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Performance analysis of FCFS and improved FCFS scheduling algorithms for dynamic real-time computer systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Optimal scheduling policies for a class of queues with customer deadlines to the beginning of serviceJournal of the ACM, 1988
- Load Sharing in Soft Real-Time Distributed Computer SystemsIEEE Transactions on Computers, 1987
- Single-server queues with impatient customersAdvances in Applied Probability, 1984
- Queueing Systems with Stochastic Time outIEEE Transactions on Communications, 1980
- Reneging Phenomena in Single Channel QueuesMathematics of Operations Research, 1979
- The Markovian Queue with Bounded Waiting timeManagement Science, 1977
- Single server queues with restricted accessibilityJournal of Engineering Mathematics, 1969
- Queuing with Impatient Customers and Indifferent ClerksOperations Research, 1957