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.
|Place of Publication||Enschede|
|Publisher||Centre for Telematics and Information Technology (CTIT)|
|Number of pages||15|
|Publication status||Published - May 2003|
|Publisher||University of Twente, Centre for Telematics and Information Technology (CTIT)|
- CAES-PS: Pervasive Systems
- EC Grant Agreement nr.: FP5/34734
Jansen, P. G., Mullender, S. J., Scholten, J., & Havinga, P. J. M. (2003). Lightweight EDF Scheduling with Deadline Inheritance. (CTIT-technical reports; No. 2003-23). Enschede: Centre for Telematics and Information Technology (CTIT).