A Method for Performance Analysis of Earliest-Deadline-First Scheduling Policy
- 1 August 2006
- journal article
- Published by Springer Science and Business Media LLC in The Journal of Supercomputing
- Vol. 37 (2), 197-222
- https://doi.org/10.1007/s11227-006-5944-2
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Asymptotic Results and a Markovian Approximation for the M(n)/M(n)/s+GI SystemQueueing Systems, 2002
- Real-time queues in heavy traffic with earliest-deadline-first queue disciplineThe Annals of Applied Probability, 2001
- On the M(n)/M(n)/s queue with impatient callsPerformance Evaluation, 1999
- Multiserver Queues with Impatient CustomersPublished by Elsevier BV ,1994
- 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
- Single-server queues with impatient customersAdvances in Applied Probability, 1984
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973
- General customer impatience in the queue GI/G/1Journal of Applied Probability, 1965
- Queuing with Impatient Customers and Ordered ServiceOperations Research, 1957