Feasibility analysis of real-time transactions
Real-Time Systems
Reducing the gap between design and scheduling
Proceedings of the 20th International Conference on Real-Time and Network 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 |
We present a method that enables an efficient implementationof the approximative response-time analysis (RTA)for tasks with offsets presented by Tindell [Using Offset Information to Analyse Static Priority Pre-emptively Scheduled Task Sets] and PalenciaGutierrez et al. [Schedulability Analysis for Tasks with Static and Dynamic Offsets].The method allows for significantly faster implementationsof schedulability tools using RTA. Furthermore, reducingcomputation time, from tens of milliseconds to just afraction of a millisecond, as we will show, is a step towardson-line RTA in for example admission control systems.We formally prove that our reformulation of earlier presentedequations is correct and allow us to statically representparts of the equation, reducing the calculations duringfix-point iteration. We show by simulations that the speed-upwhen using our method is substantial. When task setsgrow beyond a trivial number of tasks and/or transactionsa speed-up of more than 100 times (10 transactions and 10tasks/transaction) compared to the original analysis can beobtained.