RWTH Aachen University
Handling Cache Related Preemption Delay (CRPD) in a pre-emptive scheduling context for real-time systems stays an open subject despite of its practical importance. Priority assignment algorithms and feasibility tests are usually based on the assumption that preemption cost is negligible. Then, a system that could be schedulable at design time can fail to meet its timing constraints in practice due to preemption cost. In this paper, the authors propose an elementary approach to take into consideration the CRPD while assigning priorities to tasks.