Sebastian Altmeyer
Claire Maiza
ABSTRACT
In preemptive real-time systems, scheduling analyses need - in addition to the worst-case execution time - the context-switch cost. In case of preemption, the preempted and the preempting task may interfere on the cache memory.
This interference leads to additional cache misses in the preempted task. The delay due to these cache misses is referred to as the cache-related preemption delay~(CRPD), which constitutes the major part of the context-switch cost.
In this paper, we present a new approach to compute tight bounds on the CRPD for LRU set-associative caches, based on analyses of both the preempted and the preempting task. Previous approaches analyzing both the preempted and the preempting task were either imprecise or unsound.
As the basis of our approach we introduce the notion of resilience: The resilience of a memory block of the preempted task is the maximal number of memory accesses a preempting task could perform without causing an additional miss to this block. By computing lower bounds on the resilience of blocks and an upper bound on the number of accesses by a preempting task, one can guarantee that some blocks may not contribute to the CRPD. The CRPD analysis based on resilience considerably outperforms previous approaches.
- Mälardalen WCET benchmark suite. http://www.mrtc.mdh.se/projects/wcet/benchmarks.html.Google Scholar
- Papabench: a free real-time benchmark. http://www.irit.fr/recherches/ARCHI/MARCH/rubrique.php3?id_rubrique=97.Google Scholar
- B. Ackland, D. Anesko, D. Brinthaupt, S. J. Daubert, A. Kalavade, J. Knoblock, E. Micca, M. Moturi, C. J. Nicol, J. H. O'Neill, J. Othmer, E. Sackinger, K. J. Singh, J. Sweet, C. J. Terman, and J.Williams. A single-chip, 1.6 billion, 16-b mac/s multiprocessor dsp,. IEEE Journal of Solid-state circuits, 35(3):412--423, 2000.Google ScholarCross Ref
- S. Altmeyer and C. Burguiere. A new notion of useful cache block to improve the bounds of cache-related preemption delay. In ECRTS '09, pages 109--118. IEEE Computer Society, 2009. Google ScholarDigital Library
- C. Ballabriga, H. Casse, and P. Sainrat. An improved approach for set-associative instruction cache partial analysis. In SAC '08, pages 360--367, 2008. Google ScholarDigital Library
- C. Burguiere, J. Reineke, and S. Altmeyer. Cache-related preemption delay computation for set-associative caches: Pitfalls and solutions. In WCET '09, 2009.Google Scholar
- C. Ferdinand and R. Wilhelm. Fast and efficient cache behavior prediction for real-time systems. Real-Time Systems, 17(2/3):131--181, 1999. Google ScholarDigital Library
- C.-G. Lee, J. Hahn, S. L. Min, R. Ha, S. Hong, C. Y. Park, M. Lee, and C. S. Kim. Analysis of cache-related preemption delay in fixedpriority preemptive scheduling. In RTSS'96, page 264. IEEE Computer Society, 1996. Google ScholarDigital Library
- T. Lundqvist and P. Stenstrom. Timing anomalies in dynamically scheduled microprocessors. In RTSS '99, page 12, Washington, DC, USA, 1999. IEEE Computer Society. Google ScholarDigital Library
- H. S. Negi, T. Mitra, and A. Roychoudhury. Accurate estimation of cache-related preemption delay. In CODES+ISSS'03. ACM, 2003. Google ScholarDigital Library
- F. Nemer, H. Casse, P. Sainrat, J. P. Bahsoun, and M. D. Michiel. Papabench: a free real-time benchmark. In WCET '06, Dagstuhl, Germany, 2006.Google Scholar
- F. Nemer, H. Casse, P. Sainrat, and J. P. Bahsoun. Inter-task WCET computation for a-way instruction caches. In SIES '08, pages 169--176, 2008.Google ScholarCross Ref
- A. Rakib, O. Parshin, S. Thesing, and R. Wilhelm. Component-wise i-cache behavior prediction. In ATVA '04, pages 211--229, 2004.Google Scholar
- J. Reineke and D. Grund. Relative competitive analysis of cache replacement policies. In LCTES'08, pages 51--60. ACM, June 2008. Google ScholarDigital Library
- J. Reineke, B. Wachter, S. Thesing, R. Wilhelm, I. Polian, J. Eisinger, and B. Becker. A definition and classification of timing anomalies. In WCET '06, Dagstuhl, Germany, 2006.Google Scholar
- J. Staschulat and R. Ernst. Multiple process execution in cache related preemption delay analysis. In EMSOFT '04, pages 278--286. ACM, 2004. Google ScholarDigital Library
- J. Staschulat and R. Ernst. Scalable precision cache analysis for realtime software. ACM TECS, 6(4):25, 2007. ISSN 1539-9087. Google ScholarDigital Library
- Y. Tan and V. Mooney. Integrated intra- and inter-task cache analysis for preemptive multi-tasking real-time systems. In SCOPES'04, pages 182--199, 2004.Google ScholarCross Ref
- H. Tomiyama and N. D. Dutt. Program path analysis to bound cacherelated preemption delay in preemptive real-time systems. In CODES'00. ACM, 2000. Google ScholarDigital Library
Index Terms
- Resilience analysis: tightening the CRPD bound for set-associative caches
Recommendations
Resilience analysis: tightening the CRPD bound for set-associative caches
LCTES '10In preemptive real-time systems, scheduling analyses need - in addition to the worst-case execution time - the context-switch cost. In case of preemption, the preempted and the preempting task may interfere on the cache memory.
This interference leads ...
Tightening the bounds on feasible preemptions
Data caches are an increasingly important architectural feature in most modern computer systems. They help bridge the gap between processor speeds and memory access times. One inherent difficulty of using data caches in a real-time system is the ...
Tightening the CRPD bound for multilevel non-inclusive caches
AbstractTasks running on microprocessors with cache memories are often subjected to cache related preemption delays (CRPDs). CRPDs may significantly increase task execution times, thereby, affecting their schedulability. Schedulability ...
Comments