Issue No. 02 - February (2009 vol. 58)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2008.167
Enrico Bini , Scuola Superiore Sant'Anna, Pisa
Thi Huyen Châu Nguyen , University of Poitiers, Poitiers
Pascal Richard , University of Poitiers, Poitiers
Sanjoy K. Baruah , University of North Carolina, Chapel Hill
Since worst case response times must be determined repeatedly during the interactive design of real-time application systems, repeated exact computation of such response times would slow down the design process considerably. In this research, we identify three desirable properties of estimates of the exact response times: continuity with respect to system parameters, efficient computability, and approximability. We derive a technique possessing these properties for estimating the worst-case response time of sporadic task systems that are scheduled using fixed priorities upon a preemptive uniprocessor.
Fixed-priority scheduler, response time, approximation schemes, resource augmentation.
Enrico Bini, Thi Huyen Châu Nguyen, Pascal Richard, Sanjoy K. Baruah, "A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines", IEEE Transactions on Computers, vol. 58, no. , pp. 279-286, February 2009, doi:10.1109/TC.2008.167