Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
REDF: A ReservationBased EDF Scheduling Algorithm for Multiple Multimedia Task Classes
 

Summary: R­EDF: A Reservation­Based EDF Scheduling
Algorithm for Multiple Multimedia Task Classes
Wanghong Yuan, Klara Nahrstedt, Kihun Kim
Department of Computer Science
University of Illinois at Urban­Champaign, Urbana, IL 61801
{wyuan1, klara, kikim}@cs.uiuc.edu
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

  

Source: Adve, Sarita - Department of Computer Science, University of Illinois at Urbana-Champaign

 

Collections: Computer Technologies and Information Sciences