Program path analysis to bound cache-related preemption delay in preemptive real-time systems
Program path analysis to bound cache-related preemption delay in preemptive real-time systems
复制标题
DOI：
10.1145/334012.334025
复制
发表时间：
2000-05
期刊：
影响因子：
--
通讯作者：
H. Tomiyama;N. Dutt
中科院分区：
文献类型：
--
作者：
H. Tomiyama;N. Dutt
缓存内存的不可预测行为使得静态分析实时系统最坏情况下的性能变得困难。在抢占式多任务系统中，由于任务间缓存干扰（称为缓存相关抢占延迟（CRPD）），该问题会更加严重。本文提出了一种方法来分析任务可能对较低优先级任务施加的 CRPD 严格上限。我们的方法使用整数线性规划技术确定需要最大数量的缓存块的任务的程序执行路径。实验结果表明，我们的方法对 CRPD 的限制比之前的方法严格了 69%。
Unpredictable behavior of cache memory makes it difficult to statically analyze the worst-case performance of real-time systems. This problem is exacerbated in case of preemptive multitask systems due to intertask cache interference, called Cache-Related Preemption Delay (CRPD). This paper proposes an approach to analysis of the tight upper bound on CRPD which a task might impose on lower-priority tasks. Our method determines the program execution path of the task which requires the maximum number of cache blocks using an integer linear programming technique. Experimental results show that our approach provides up to 69% tighter bounds on CRPD than a previous approach.