Scalable precision cache analysis for preemptive scheduling
Scalable precision cache analysis for preemptive scheduling
复制标题
用于抢占式调度的可扩展精度缓存分析
DOI：
10.1145/1065910.1065933
复制
发表时间：
2005
影响因子：
3.7
通讯作者：
R. Ernst
中科院分区：
文献类型：
--
作者：
J. Staschulat;R. Ernst
准确的时序分析是嵌入式系统高效综合和集成的关键。缓存是提高处理器性能所必需的，但由于其行为复杂，很难使用，特别是在抢占式调度中。当前的方法使用简化的假设或提出指数复杂的分析算法来在上下文切换时限制与高速缓存相关的抢占延迟。针对现有方法只考虑直接映射缓存或提出组相联缓存非保守近似的问题，提出了一种新的组相联指令缓存相关抢占延迟分析方法，设计者可以通过调整问题的复杂度来调整分析精度。此外，这种精确的抢占延迟分析被整合到调度分析中，以准确地确定任务的响应时间。在实验中，我们评估了分析精度和分析时间之间的权衡。结果表明，与以往的保守方法相比，缓存相关抢占延迟的分析精度提高了22%~71%，响应时间分析提高了5%~21%。
Accurate timing analysis is key to efficient embedded system synthesis and integration. Caches are needed to increase the processor performance but they are hard to use because of their complex behavior especially in preemptive scheduling. Current approaches use simplified assumptions or propose exponentially complex analysis algorithms to bound the cache related preemption delay at a context switch. Existing approaches consider only direct mapped caches or propose non conservative approximation for set associative caches.In this paper we propose a novel cache related preemption delay analysis for set-associative instruction caches where the designer can adjust the analysis precision by scaling the problem complexity. Furthermore, this precise preemption delay analysis is integrated into a scheduling analysis to determine the response time of tasks accurately. In experiments we evaluate this tradeoff between analysis precision and analysis time. The results show an improvement of 22%-71% in analysis precision of cache related preemption delay and 5%-21% in response time analysis compared to previous conservative approaches.