Loading...

Non-preemptive earliest-deadline-first scheduling policy: A performance study

Kargahi, M ; Sharif University of Technology | 2005

137 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/MASCOTS.2005.44
  3. Publisher: 2005
  4. Abstract:
  5. 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. © 2005 IEEE
  6. Keywords:
  7. Fault tolerant computer systems ; Markov processes ; Parameter estimation ; Queueing networks ; Scheduling ; Servers ; Single server queue ; Transient faults ; Virtual subsystems ; Real time systems
  8. Source: MASCOTS 2005: 13th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems, Atlanta, GA, 27 September 2005 through 29 September 2005 ; Volume 2005 , 2005 , Pages 201-208 ; 15267539 (ISSN)
  9. URL: https://ieeexplore.ieee.org/document/1521134