Optimal deadline assignment for periodic real-time tasks in dynamic priority systems

Authors:
Patricia Balbastre;Ismael Ripoll;Alfons Crespo
Affiliations:
Technical University of Valencia, Spain;Technical University of Valencia, Spain;Technical University of Valencia, Spain
Venue:
ECRTS '06 Proceedings of the 18th Euromicro Conference on Real-Time Systems
Year:
2006

Citing 0
Cited 5

Analysis of window-constrained execution time systems

Real-Time Systems
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
Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling

Journal of Systems Architecture: the EUROMICRO Journal
Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Real-time systems are often designed using a set of periodic task. Task periods are usually set by the system requirements, but deadlines and computation times can be modified in order to improve system performance. Sensitivity analysis in real-time systems has focused on changes in task computation times, using fixed priority analysis. Only a few studies deal with the modification of deadlines in dynamic-priority scheduling. The aim of this work is to provide a sensitivity analysis for task deadlines in the context of dynamic-priority, pre-emptive, uniprocessor scheduling. In this paper, we present a deadline minimisation method that achieves the maximum reduction. As undertaken in other studies concerning computation times, we also define and calculate the critical scaling factor for task deadlines. Our proposal is evaluated and compared with other works in terms of jitter: The deadline minimisation can be used to strongly reduce jitter of control tasks, in a real-time control application.