Response time bounds for static-priority tasks and arbitrary relative deadlines with resource augmentation

In this paper we propose parametric approximation algorithm (Fully Polynomial Time Approximation Scheme - FPTAS) that defines a compromise on the precision of computed worst-case response time upper bounds and the amount of extra processor speed required to achieve exact worst-case response times. Such a result fills the remaining gap between our previously published work [11] and also extends them to tasks with arbitrary relative deadlines. The method has been implemented and numerical results monitoring speedup factors are presented.