Faster Response Time Analysis of Tasks With Offsets

We present a method that enables an efficient implementation of the approximative response time analysis for tasks with offsets presented by Tindell [7] and Palencia Gutierrez et al. [2]. The method utilises the fact that the interference a transaction imposes on a lower priority task exhibits a periodic and static pattern. This pattern can be pre-computed in a table, reducing the fix-point calculations to a simple lookupup function. We show by simulations that the speed-up is substantial, and for realistically sized task sets, more than 600 times, compared to the original analysis.