An approximation to the response time for shortest queue routing
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A Performance Analysis of Minimum Laxity and Earliest Deadline Scheduling in a Real-Time System
IEEE Transactions on Computers
An Approximate Analysis of the Join the Shortest Queue (JSQ) Policy
IEEE Transactions on Parallel and Distributed Systems
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)
IEEE Transactions on Computers
An approximate analysis of the shortest queue policy on soft real-time scheduling
ACM SIGMETRICS Performance Evaluation Review
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
IEEE Transactions on Computers
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Optimal control of parallel queues with impatient customers
Performance Evaluation - Performance modelling and evaluation of high-performance parallel and distributed systems
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
Energy-Constrained Scheduling for Weakly-Hard Real-Time Systems
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
A Method for Performance Analysis of Earliest-Deadline-First Scheduling Policy
The Journal of Supercomputing
| Hi-index | 0.00 |
This paper introduces an analytical method for approximating the performance of a firm real-time system consisting of a number of parallel infinite-capacity single-server queues. The service discipline for the individual queues is earliest-deadline-first (EDF). Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. Jobs either all have deadlines until the beginning of service or deadlines until the end of service. Upon arrival, a job joins a queue according to a state-dependent stationary policy, where the state of the system is the number of jobs in each queue. Migration among the queues is not allowed. An important performance measure to consider is the overall loss probability of the system. The system is approximated by a Markovian model in the long run. The resulting model can then be solved analytically using standard Markovian solution techniques. Comparing numerical and simulation results for at least three different stationary policies, we find that the existing errors are relatively small.