Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performance Study

Authors:
Mehdi Kargahi;Ali Movaghar
Affiliations:
School of Computer Science, IPM and Department of Computer Engineering, Sharif University of Technology, Tehran, Iran;Department of Computer Engineering, Sharif University of Technology, Tehran, Iran
Venue:
MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Year:
2005

Citing 0
Cited 10

A Method for Performance Analysis of Earliest-Deadline-First Scheduling Policy

The Journal of Supercomputing
Efficient Load Balancing Schemes for Large-Scale Real-Time HLA/RTI Based Distributed Simulations

DS-RT '07 Proceedings of the 11th IEEE International Symposium on Distributed Simulation and Real-Time Applications
ReSP: a nonintrusive transaction-level reflective MPSoC simulation platform for design space exploration

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Dynamic routing of real-time jobs among parallel EDF queues: A performance study

Computers and Electrical Engineering
A real-time application design methodology for MPSoCs

Proceedings of the Conference on Design, Automation and Test in Europe
A portable infrastructure supporting global scheduling of embedded real-time applications on asymmetric MPSoCs

ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part II
Packet skipping and network coding for delay-sensitive network communication

Performance Evaluation
Analytical leakage/temperature-aware power modeling and optimization for a variable speed real-time system

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces an analytical method for approximating the performance of a soft real-time system modeled by a single-server queue. The service discipline in the queue is earliest-deadline-first (EDF), which is an optimal scheduling policy. Real-time jobs with exponentially distributed deadlines arrive according to a Poisson process. All jobs have deadlines until the end of service and are served non-preemptively. Occurrences of transient faults in the server are also taken into account. The important performance measure to calculate is the loss probability due to deadline misses and/or transient faults. The system is approximated by a Markovian model in the long run. A key parameter, namely, the loss rate when there are n jobs in the system is used in the model, which is estimated by partitioning the system into two virtual subsystems. The resulting model can then be solved analytically using standard Markovian solution techniques. Comparing numerical and simulation results, we find that the existing errors are relatively small.