Journal of the ACM (JACM)
A Performance Analysis of Minimum Laxity and Earliest Deadline Scheduling in a Real-Time System
IEEE Transactions on Computers
Using real-time queueing theory to control lateness in real-time systems
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On the M(n)/M(n)/s queue with impatient calls
Performance Evaluation
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Dynamic power management in a mobile multimedia system with guaranteed quality-of-service
Proceedings of the 38th annual Design Automation Conference
On queueing with customer impatience until the beginning of service
Queueing Systems: Theory and Applications
Asymptotic Results and a Markovian Approximation for the M(n)/M(n)/s+GI System
Queueing Systems: Theory and Applications
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
A Method for Performance Analysis of Earliest-Deadline-First Scheduling Policy
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performance Study
MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Stochastic DVS-based dynamic power management for soft real-time systems
Microprocessors & Microsystems
Dynamic routing of real-time jobs among parallel EDF queues: A performance study
Computers and Electrical Engineering
Packet skipping and network coding for delay-sensitive network communication
Performance Evaluation
Proceedings of the 20th International Conference on Real-Time and Network Systems
Analytical architecture-based performability evaluation of real-time software systems
Journal of Systems and Software
Thermal analysis of periodic real-time systems with stochastic properties: an analytical approach
Proceedings of the 21st International conference on Real-Time Networks and Systems
| Hi-index | 0.00 |
This paper introduces an analytical method to approximate the fraction of jobs missing their deadlines in a soft real-time system when the earliest-deadline-first (EDF) scheduling policy is used. In the system, jobs either all have deadlines until the beginning of service (DBS) and are non-preemptive, or have deadlines until the end of service (DES) and are preemptive. In the former case, the system is represented by an M/M/m/EDF+G model, i.e., a multi-sever queue with Poisson arrival, exponential service, and generally distributed relative deadlines. In the latter case, it is represented by an M/M/1/EDF+G model, i.e., a single-server queue with the same specifications as before. EDF is known to be optimal in both of the above cases. The optimality property of EDF scheduling policy is used for the estimation of a key parameter, namely the loss rate when there are n jobs in the system. The estimation is possible by assuming an upper bound and a lower bound for this parameter and then linearly combining these two bounds together. The resulting Markov chains can then be easily solved numerically. Comparing numerical and simulation results, we find that the existing errors are relatively small.