Improved techniques to compute Cache Related Preemption Delay using non-nested preemptions

摘要

The computation of Cache Related Preemption Delay (CRPD) is an important problem to assess the schedulability of a task system. In this paper, we have introduced a novel method to calculate tight bounds on the number of preemptions of every task using the concept of non-nested preemptions. We have modified existing analytical techniques to calculate CRPD using these tight bounds. An algorithm is presented to compute the worst and the best response times for every task across all possible phases in the presence of CRPD costs. An empirical evaluation is done on a large number of tasksets varying different task and cache parameters, which demonstrates that our methods achieve better results.