A Technique to Calculate Cache Related Preemption Delay Using Constraints on Non-nested Preemptions

Abstract Caches incur an indirect cost to the response times of tasks due to preemptions in a task system. Hence 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 the concept of inhibiting and non-nested preemptions. We have proposed a novel method to calculate tight upper and lower bounds on the number of preemptions of every task in the task-system across all phases . The problem of calculation of CRPD is modelled as a constraint satisfaction problem that can be solved by using Integer Linear Programming (ILP). The CRPD values are integrated in the worst case response time analysis.

[1]  Andy J. Wellings,et al.  Adding instruction cache effect to schedulability analysis of preemptive real-time systems , 1996, Proceedings Real-Time Technology and Applications.

[2]  Chang-Gun Lee,et al.  Bounding Cache-Related Preemption Delay for Real-Time Systems , 2001, IEEE Trans. Software Eng..

[3]  Mathai Joseph,et al.  Finding Response Times in a Real-Time System , 1986, Comput. J..

[4]  Chang-Gun Lee,et al.  Analysis of Cache-Related Preemption Delay in Fixed-Priority Preemtive Scheduling , 1998, IEEE Trans. Computers.

[5]  Yudong Tan,et al.  Timing analysis for preemptive multi-tasking real-time systems with caches , 2004, Proceedings Design, Automation and Test in Europe Conference and Exhibition.

[6]  Robert I. Davis,et al.  Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems , 2011, 2011 IEEE 32nd Real-Time Systems Symposium.

[7]  Giorgio C. Buttazzo,et al.  Measuring the Performance of Schedulability Tests , 2005, Real-Time Systems.

[8]  Ola Redell,et al.  Exact best-case response time analysis of fixed priority scheduled tasks , 2002, Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002.

[9]  Frank Mueller,et al.  Tightening the bounds on feasible preemptions , 2011, TECS.

[10]  Rolf Ernst,et al.  Scheduling analysis of real-time systems with precise modeling of cache related preemption delay , 2005, 17th Euromicro Conference on Real-Time Systems (ECRTS'05).