R-EDF: A Reservation-Based EDF Scheduling Algorithm for Multiple Multimedia Task Classes

  • Authors:
  • Wanghong Yuan;Klara Nahrstedt;Kihun Kim

  • Affiliations:
  • -;-;-

  • Venue:
  • RTAS '01 Proceedings of the Seventh Real-Time Technology and Applications Symposium (RTAS '01)
  • Year:
  • 2001

Quantified Score

Hi-index 0.01

Visualization

Abstract

Abstract: Multimedia applications became an integral part of the ubiquitous computing environment in general-purpose systems. However, current general-purpose operating systems cannot effectively support their soft real-time requirements. This paper presents a reservation-based preemptive earliest deadline first (R-EDF) algorithm to provide a predictable scheduling framework in an open shared environment. The major contributions of R-EDF are: (1) it delivers timing guarantees to four soft real-time task classes such as period class with constant and various processing time, aperiodic class and event-based class; (2) it provides starvation protection for best-effort tasks; (3) it provides overrun protection and handling so that an overrun task will not cause other tasks to miss deadlines and will finish its work within an acceptable and predictable time bound; and (4) it allows optimistic reservation and incurs low overhead cost for reservation and admission control. Our experimental results show the low overhead and correctness of R-EDF even when there is resource contention.