Enhanced analysis of cache-related preemption delay in fixed-priority preemptive scheduling

Abstract

We propose an enhanced technique for analyzing and thus, bounding cache-related preemption delay in jixedpriority preemptive scheduling focusing on instruction caching. The proposed technique improves upon previous techniques in two important ways. First, the technique takes into account the relationship between a preempted task and the set of tasks that execute during the preemption when calculating the cache-related preemption delay. Second, the technique considers phasing of tasks to eliminate many infeasible task interactions. These two features are expressed as constraints of a linear programming problem whose solution gives a guaranteed upper bound on the cache-related preemption delay. This paper also compares the proposed technique with previous techniques. The results show that the proposed technique gives up to 60% tighterprediction of the worst case response time than the previous techniques.