Affiliation:
1. Technical University of Braunschweig, Braunschweig, Germany
Abstract
Caches are needed to increase the processor performance, but the temporal behavior is difficult to predict, especially in embedded systems with preemptive scheduling. Current approaches use simplified assumptions or propose complex analysis algorithms to bound the cache-related preemption delay. In this paper, a scalable preemption delay analysis for associative instruction caches to control the analysis precision and the time-complexity is proposed. An accurate preemption delay calculation is integrated into a cache-aware schedulability analysis. The framework is evaluated in several experiments.
Publisher
Association for Computing Machinery (ACM)
Subject
Hardware and Architecture,Software
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Scope-Aware Useful Cache Block Calculation for Cache-Related Pre-Emption Delay Analysis With Set-Associative Data Caches;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2020-10
2. Resource-efficient cyber-physical systems design: A survey;Microprocessors and Microsystems;2020-09
3. Analyzing Data Cache Related Preemption Delay With Multiple Preemptions;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2018-11
4. Parametric Utilization Bounds;Techniques for Building Timing-Predictable Embedded Systems;2016
5. Analyzing Non-preemptive Global Scheduling;Techniques for Building Timing-Predictable Embedded Systems;2016