Loss ratio of the EDF scheduling policy with early discarding technique

https://doi.org/10.1016/j.ipl.2012.12.015Get rights and content

Abstract

This paper considers a firm real-time M/M/1 system, where jobs have stochastic deadlines till the end of service. A method for approximately specifying the loss ratio of the earliest-deadline-first scheduling policy along with exit control through the early discarding technique is presented. This approximation uses the arrival rate and the mean relative deadline, normalized with respect to the mean service time, for exponential and uniform distributions of relative deadlines. Simulations show that the maximum approximation error is less than 4% and 2% for the two distributions, respectively, for a wide range of arrival rates and mean relative deadlines.

References (15)

  • Qiu Fang et al.

    Scheduling on-demand broadcast with timing constraints

    Journal of Parallel and Distributed Computing

    (2009)
  • Onno Boxma et al.

    The M/G/1+G queue revisited

    Queueing Systems

    (2011)
  • Sudipta Das, Debasis Sengupta, Lawrence Jenkins, Analysis of an M/M/1+G queue operated under the FCFS policy with exact...
  • Sudipta Das, Debasis Sengupta, Lawrence Jenkins, Comparison of loss ratios of different scheduling algorithms,...
  • Bezalel Gavish et al.

    The Markovian queue with bounded waiting time

    Management Science

    (1977)
  • Rolf B. Haugen et al.

    Queueing systems with stochastic time out

    IEEE Transaction on Communications

    (1980)
  • Kargahi Mehdi et al.

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

    The Journal of Supercomputing

    (2006)
There are more references available in the full text version of this article.

Cited by (0)

View full text
Copyright © 2013 Elsevier B.V. All rights reserved.