12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06) Computing the Minimum EDF Feasible Deadline in Periodic Systems Sydney, Australia August 16-August 18 ISBN: 0-7695-2676-4
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTCSA.2006.22
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.
Citation:
Hoai Hoang, Giorgio Buttazzo, Magnus Jonsson, Stefan Karlsson, "Computing the Minimum EDF Feasible Deadline in Periodic Systems," rtcsa, pp.125-134, 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06), 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb