Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Feasibility analysis of real-time transactions
Real-Time Systems
Best-case response times and jitter analysis of real-time tasks with arbitrary deadlines
Proceedings of the 21st International conference on Real-Time Networks and Systems
| Hi-index | 0.00 |
In previous work, we presented a tight approximate response-timeanalysis for tasks with offsets. While providing a tight boundon response times, the tight analysis exhibits similarly longexecution times as does the traditional methods for calculatingresponse-times for tasks with offsets. The existing method for fastanalysis of tasks with offsets is not applicable to the tight analysis. In this paper we extend the fast analysis to handle the distinguishing trait of the tight analysis; continuously increasing interference functions. Furthermore, we provide anotherspeedup; by introducing pessimism in the modelling of interferenceat certain points, we speed up the convergence of the numericalsolving for response-times without increasing the pessimism of theresulting responsetimes. The presented fast-and-tight analysis isguaranteed to calculate the same response-times as the tight analysis, and in a simulation study we obtain speedups of more than two orders of magnitude for realistically sized tasks sets compared to the tight analysis. We also demonstrate that the fast-and-tightanalysis has comparable execution time to that of the fast analysis.Hence, we conclude that the fast-and-tight analysis is the preferredanalysis technique when tight estimates of response-times are needed,and that we do not need to sacrifice tightness for analysis speed;both are obtained with the fast-and-tight analysis.