Computing the Minimum EDF Feasible Deadline in Periodic Systems

Authors:
Hoai Hoang;Giorgio Buttazzo;Magnus Jonsson;Stefan Karlsson
Affiliations:
Halmstad University, Sweden;Scuola Superiore S. Anna, Italy;Halmstad University, Sweden;-
Venue:
RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Year:
2006

Citing 0
Cited 7

Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems

IEEE Transactions on Computers
The space of EDF deadlines: the exact region and a convex approximation

Real-Time Systems
Period sensitivity analysis and D-P domain feasibility region in dynamic priority systems

Journal of Systems and Software
A lazy EDF interrupt scheduling algorithm for multiprocessor in parallel computing environment

ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
Sensitivity analysis of arbitrary deadline real-time systems with EDF scheduling

Real-Time Systems
Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme

Real-Time Systems
An EDF run-time profile based on ravenscar

ACM SIGAda Ada Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In most real-time applications, deadlines are artifices that need to be enforced to meet different performance requirements. For example, in periodic task sets, jitter requirements can be met by assigning suitable relative deadlines and guaranteeing the feasibility of the schedule. This paper presents a method (called minD) for calculating the minimum EDF-feasible deadline of a real-time task. More precisely, given a set of periodic tasks with hard real-time requirements, which is feasible under EDF, the proposed algorithm allows computing the shortest deadline that can be assigned to an arbitrary task in the set, or to a new incoming task (periodic or aperiodic), still preserving the EDF feasibility of the new task set. The algorithm has a pseudo polynomial complexity and handles arbitrary relative deadlines, which can be less than, equal to, or greater than periods.