Improved approximate response time bounds for static-priority tasks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2000

Improved approximate response time bounds for static-priority tasks


We consider sporadic tasks with static priorities and constrained deadlines to be executed upon a uniprocessor platform. Pseudo-polynomial time algorithms are known for computing worst-case response times for this task model. Some applications require to evaluate efficiently upper bounds of response times. For this purpose, we propose parametric algorithms that allow to make a tradeoff between quality of results and computational effort according to an input accuracy parameter. In this paper, we present a parametric polynomial-time algorithm for computing upper bounds of worst-case response times, that is based on an improved FPTAS (Fully Polynomial Time Approximation Scheme). Then, we show that our bound does not achieve constant error bound in comparison with the exact worstcase response time. However, using the resource augmentation technique, we obtain a performance guarantee that allows to define a compromise between our response-time bound and processor capacity requirements. The algorithm average behavior is then analyzed through numerical experimentations.
Fichier principal
Vignette du fichier
nguyen.pdf (541.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00336498 , version 1 (04-11-2008)


  • HAL Id : inria-00336498 , version 1


Thi Huyen Chau Nguyen, Pascal Richard, Enrico Bini. Improved approximate response time bounds for static-priority tasks. 16th International Conference on Real-Time and Network Systems (RTNS 2008), Isabelle Puaut, Oct 2008, Rennes, France. ⟨inria-00336498⟩
109 View
314 Download


Gmail Facebook X LinkedIn More