A method for performance analysis of earliest-deadline-first scheduling policy

  • Kargahi M
  • Movaghar A
  • 22


    Mendeley users who have this article in their library.
  • 34


    Citations of this article.


This paper introduces an analytical method for approximating the fraction of jobs that miss their deadlines in a real-time system when earliest-deadline-first scheduling policy (EDF) is used. In the system, jobs either all have deadlines until the beginning of service or deadlines until the end of service. In the former case, EDF is known to be optimal and, in the latter case, it is optimal if preemption is allowed. In both cases, the system is modeled by an M/M/1/EDF+M queue, i.e., a single server queue with Poisson arrival, and service times and customer impatience, which are exponentially distributed. The optimality property of EDF is used for the estimation of a key parameter, γn, which is the loss rate when there are n customers in the system. The estimation is possible by finding an upper bound and a lower bound for γn and linearly combining these two bounds. The resulting Markov chains are then easy to solve numerically. Comparing numerical and simulation results, we find that the existing errors are relatively small.

Author-supplied keywords

  • Analytical methods
  • Approximation methods
  • Earliest-deadline-first (EDF)
  • Multiprocessor systems
  • Performance modeling
  • Soft real-time (SRT) systems

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free