Integration of Cache Related Preemption Delay Analysis in Priority Assignment Algorithm

Handling cache related preemption delay (CRPD) in a preemptive 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 article, we propose an elementary approach to take into consideration the CRPD while assigning priorities to tasks. The goal is to acquire a priority assignment algorithm guaranteeing the schedulability of the system when its tasks suffer CRPD at run-time.