The use of hardware caches became essential in modern embedded systems to address the speed gap between processor and memory. In such systems, cache-related preemption delay (CRPD) may represent a significant proportion of task execution time. Addressing this delay in scheduling simulation of these systems stays an open and under-examined problem. Assumptions are often made to simplify the computation model used in simulation and capture the worst-case effect. Nevertheless, they can introduce situations in which scheduling simulation is considered not only pessimistic but also non-sustainable. In this article, we discuss the problem and propose a less pessimistic CRPD computation model that allows sustainable scheduling simulation regarding the capacity parameter. With the proposed model, a system that is schedulable with simulated worst-case execution times remains so when these parameters are reduced. These results improve the applicability of scheduling simulation in the early verification stage for systems with caches. Experiments conducted with our CRPD computation model show a 5% to 12% improvement of schedulability task set coverage and a 30% to 50% reduction of preemption cost with regard to existing CRPD computation models. An integration in a scheduling simulator and a performance evaluation are also realized for the proposed model.

在现代嵌入式系统中，使用硬件缓存来解决处理器和内存之间的速度差距变得至关重要。在这样的系统中，与缓存相关的抢占延迟（CRPD）可能占任务执行时间的很大一部分。解决这些系统的调度仿真中的这种延迟仍然是一个悬而未决的问题。经常进行假设以简化仿真中使用的计算模型并捕获最坏情况的影响。但是，他们可能会引入这样的情况：调度模拟不仅被认为是悲观的，而且被认为是不可持续的。在本文中，我们讨论了这个问题，并提出了一个不太悲观的CRPD计算模型，该模型允许对容量参数进行可持续的调度仿真。使用建议的模型，可以安排具有模拟最坏情况执行时间的可调度系统，以便在减少这些参数时使用。这些结果提高了在具有缓存的系统的早期验证阶段进行调度模拟的适用性。使用我们的CRPD计算模型进行的实验表明，与现有的CRPD计算模型相比，可调度性任务集覆盖率提高了5％至12％，抢占成本降低了30％至50％。对于所提出的模型，还实现了调度模拟器中的集成和性能评估。使用我们的CRPD计算模型进行的实验表明，与现有的CRPD计算模型相比，可调度性任务集覆盖率提高了5％至12％，抢占成本降低了30％至50％。对于所提出的模型，还实现了调度模拟器中的集成和性能评估。使用我们的CRPD计算模型进行的实验表明，与现有的CRPD计算模型相比，可调度性任务集覆盖率提高了5％至12％，抢占成本降低了30％至50％。对于所提出的模型，还实现了调度模拟器中的集成和性能评估。