A Performance Analysis of Minimum Laxity and Earliest Deadline Scheduling in a Real-Time System
IEEE Transactions on Computers
On-line scheduling in the presence of overload
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On the competitiveness of on-line real-time task scheduling
Real-Time Systems
Dover: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
SIAM Journal on Computing
On queueing with customer impatience until the beginning of service
Queueing Systems: Theory and Applications
On Queuing with Customer Impatience until the End of Service
IPDS '00 Proceedings of the 4th International Computer Performance and Dependability Symposium
Worst Case Analysis for On-Line Scheduling in Real-Time Systems
Worst Case Analysis for On-Line Scheduling in Real-Time Systems
Best-effort decision-making for real-time scheduling
Best-effort decision-making for real-time scheduling
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
| Hi-index | 0.00 |
We consider a queueing system with jobs having hard deadlines. This is motivated by recent emerging unified messaging service applications. The service time of a job is assumed to be known upon arrival. A job will be lost if not being served by its deadline. For the single-server system, we propose an on-line ED-Push algorithm that is easy to implement and can achieve near-optimal performance in terms of minimizing the loss probability. Performance analyses for the underlying M/M/l+D and G/D/1+D systems are then provided. We also give approximation on the loss probability for the system with multiple servers under least workload routing scheme. The numerical results show that ED-Push algorithm performs well.