| | |
Summary: REDF: A ReservationBased EDF Scheduling
Algorithm for Multiple Multimedia Task Classes
Wanghong Yuan, Klara Nahrstedt, Kihun Kim
Department of Computer Science
University of Illinois at UrbanChampaign, Urbana, IL 61801
{wyuan1, klara, kikim}@cs.uiuc.edu
Abstract
Multimedia applications became an integral part of
the ubiquitous computing environment in generalpurpose
systems. However, current generalpurpose operating
systems cannot effectively support their soft realtime
requirements. This paper presents a reservationbased
preemptive earliest deadline first (REDF) algorithm to
provide a predictable scheduling framework in an open
shared environment. The major contributions of REDF
are: (1) it delivers timing guarantees to four soft realtime
task classes such as period class with constant and
various processing time, aperiodic class and eventbased
class; (2) it provides starvation protection for besteffort
tasks; (3) it provides overrun protection and handling so
|