View in EDS

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

Saved in:
Bibliographic Details
Title: Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems.
Authors: Balbastre, Patricia1 patricia@disca.upv.es, Ripoll, Ismael1 iripoll@disca.upv.es, Crespo, Alfons1 acrespo@disca.upv.es
Source: IEEE Transactions on Computers. Jan2008, Vol. 57 Issue 1, p96-109. 14p. 3 Black and White Photographs, 3 Charts, 15 Graphs.
Subjects: Real-time computing software, Real-time programming software, Time series analysis software, Computer scheduling, Computer science research, Computer systems management, Computer engineering
Abstract: Real-time systems are often designed using a set of periodic tasks. 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, preemptive, uniprocessor scheduling. In this paper, we present a deadline minimization method that computes the shortest deadline of a periodic task. 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. The deadline minimization proposed strongly reduces jitter and the response time of control tasks, which can lead to a significant improvement in system performance. [ABSTRACT FROM AUTHOR]
Copyright of IEEE Transactions on Computers is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:Real-time systems are often designed using a set of periodic tasks. 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, preemptive, uniprocessor scheduling. In this paper, we present a deadline minimization method that computes the shortest deadline of a periodic task. 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. The deadline minimization proposed strongly reduces jitter and the response time of control tasks, which can lead to a significant improvement in system performance. [ABSTRACT FROM AUTHOR]
ISSN:00189340
DOI:10.1109/TC.2007.70787