HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Approximation des temps de réponse des tâches sporadiques à priorité fixe dans les systèmes monoprocesseurs

Abstract : Two techniques are used to verify if real-time tasks meet their deadlines : schedulability tests that return a binary result (schedulable or not) and the calculation of the response times (Response Time Analysis - RTA) which determines the length of the longest interval between the release instant and the completion of a task. Both approaches have a pseudo-polynomial time complexity and please note that no polynomial time algorithm is known. In this context, they are not particularly suitable for interactive design of real-time systems or to analyze distributed systems using an holistic analysis. In such scenarios, a pseudo-polynomial time algorithm is slow, since the computations of the task response times are performed many times. Moreover, for some real time systems, such as the control-command systems, it is necessary to know the task worst-case response times and not only the binary decision on the tasks schedulability. In this context, it may be acceptable to use a faster algorithm which provides an approximate analysis instead of the analysis based on exact calculations. As these approximations will produce pessimism in the decision process, it is desirable to quantify this pessimism in such a way as to define a compromise between computation time and resource requirement of processor. That is the reason why, in this work, we propose efficient algorithms to compute upper bounds of worst-case response times and we present results on their qualities in the worst-case (competitive analysis resource augmentation) and in the average (simulations).
Document type :
Complete list of metadata

Cited literature [35 references]  Display  Hide  Download

Contributor : Bénédicte Carouge Connect in order to contact the contributor
Submitted on : Monday, January 10, 2011 - 3:32:43 PM
Last modification on : Wednesday, October 20, 2021 - 3:22:09 AM
Long-term archiving on: : Monday, April 11, 2011 - 4:17:30 PM


  • HAL Id : tel-00554265, version 1



Thi Huyen Chau Nguyen. Approximation des temps de réponse des tâches sporadiques à priorité fixe dans les systèmes monoprocesseurs. Sciences de l'ingénieur [physics]. ISAE-ENSMA Ecole Nationale Supérieure de Mécanique et d'Aérotechique - Poitiers, 2010. Français. ⟨tel-00554265⟩



Record views


Files downloads