Home > Publications
Home University of Twente
Prospective Students
Intranet (internal)

EEMCS EPrints Service

864 Lightweight EDF Scheduling with Deadline Inheritance
Home Policy Brochure Browse Search User Area Contact Help

Jansen, P.G. and Mullender, S.J. and Havinga, P.J.M. and Scholten, J. (2003) Lightweight EDF Scheduling with Deadline Inheritance. Technical Report TR-CTIT-03-23, Centre for Telematics and Information Technology University of Twente, Enschede. ISSN 1381-3625

Full text available as:


161 Kb
Open Access


EDFI is a lightweight real-time scheduling protocol that combines EDF with deadline inheritance over shared resources. We will show that EDFI is flexible during a tasks admission control, efficient with scheduling and dispatching, and straightforward in feasibility analysis. The application programmer only needs to specify a tasks timing constraints (deadline, period, runtime) and resource needs, after which EDFI can execute admission control, scheduling, dispatching and resource synchronisation automatically. EDFI avoids gratuitous task switching and its programming overhead as well as runtime overhead is very low, which makes it ideal for lightweight and featherweight kernels. We will illustrate the elegance of the underlying theory and we will shortly discuss the implementation of EDFI in three different operating systems.

Item Type:Internal Report (Technical Report)
Research Group:EWI-DIES: Distributed and Embedded Security, EWI-CAES: Computer Architecture for Embedded Systems
Research Program:CTIT-UBRICKS: Building Blocks for Ubiquitous Computing and Communication
Research Project:@HA: @ Home Anywhere
Additional Information:Imported from DIES
ID Code:864
Deposited On:12 December 2005
More Information:statistics

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item