research-article

Precise and Efficient Analysis of Context-Sensitive Cache Conflict Sets

Authors:

Florian Brandner,

Camille NoûsAuthors Info & Claims

RTNS '20: Proceedings of the 28th International Conference on Real-Time Networks and Systems

Pages 44 - 55

https://doi.org/10.1145/3394810.3394811

Published: 12 June 2020 Publication History

Abstract

Bounding the Worst-Case Execution Time (WCET) of real-time software requires precise knowledge about the reachable program and hardware states that might be observed at runtime. The analysis of precise cache states is particularly important and challenging. Due to the high cost of cache misses the analysis precision may have an important impact on the obtainable WCET bounds, while the large state space of the cache's history leads to high analysis complexity.

This work explores the use of cache summaries in order to optimize the computation of precise cache states. These cache summaries allow us to pre-compute the impact of executing a portion of a program, typically a function, on the cache state. This allows us, for instance, to skip the analysis of entire functions (including nested function calls) when the cache states within these functions are not relevant for the classification of memory accesses into hits/misses. Furthermore, the summaries can be extended to efficiently compute fully context-sensitive cache states. The summaries then not only allow to derive typical cache hit/miss classifications, but also provide fully context-sensitive cache persistence information.

References

[1]

Alfred V. Aho, Monica S. Lam, Ravi Sethi, and Jeffrey D. Ullman. 2006. Compilers: Principles, Techniques, and Tools (2nd ed.). Addison-Wesley.

Digital Library

[2]

Martin Alt, Christian Ferdinand, Florian Martin, and Reinhard Wilhelm. 1996. Cache Behavior Prediction by Abstract Interpretation. In Proc. of the International Symposium on Static Analysis (SAS '96). Springer, 52--66.

[3]

Clément Ballabriga and Hugues Casse. 2008. Improving the First-Miss Computation in Set-Associative Instruction Caches. In Proc. of the Euromicro Conference on Real-Time Systems (ECRTS '08). IEEE, 341--350. https://doi.org/10.1109/ECRTS.2008.34

Digital Library

[4]

C. Ballabriga, H. Casse, and P. Sainrat. 2008. An Improved Approach for Set-associative Instruction Cache Partial Analysis. In Proc. of the Symposium on Applied Computing (SAC '08). ACM, 360--367. https://doi.org/10.1145/1363686.1363778

Digital Library

[5]

Sudipta Chattopadhyay and Abhik Roychoudhury. 2011. Scalable and Precise Refinement of Cache Timing Analysis via Model Checking. In Proc. of the Real-Time Systems Symposium (RTSS '11). IEEE, 193--203. https://doi.org/10.1109/RTSS.2011.25

Digital Library

[6]

D. Chu, J. Jaffar, and R. Maghareh. 2016. Precise Cache Timing Analysis via Symbolic Execution. In Proc. of the Real-Time and Embedded Technology and Applications Symposium (RTAS '16). 1--12. https://doi.org/10.1109/RTAS.2016.7461358

[7]

Patrick Cousot and Radhia Cousot. 1977. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proc. of the Symposium on Principles of Programming Languages (POPL '77). ACM, 238--252. https://doi.org/10.1145/512950.512973

Digital Library

[8]

Christoph Cullmann. 2013. Cache Persistence Analysis: Theory and Practice. ACM Trans. Embed. Comput. Syst. 12, 1s, Article 40 (March 2013), 25 pages. https://doi.org/10.1145/2435227.2435236

Digital Library

[9]

Philipp Degasperi, Stefan Hepp, Wolfgang Puffitsch, and Martin Schoeberl. 2014. A Method Cache for Patmos. In Proc. of the International Symposium on Object/Component-Oriented Real-Time Distributed Computing (ISORC '14). IEEE, 100--108. https://doi.org/10.1109/ISORC.2014.47

Digital Library

[10]

D. L. Dvorak (editor). 2009. NASA Study on Flight Software Complexity. Technical Excellence Initiative. NASA Office of Chief Engineer.

[11]

Heiko Falk, Sebastian Altmeyer, Peter Hellinckx, Björn Lisper, Wolfgang Puffitsch, Christine Rochange, Martin Schoeberl, Rasmus Bo Sørensen, Peter Wägemann, and Simon Wegener. 2016. TACLeBench: A Benchmark Collection to Support Worst-Case Execution Time Research. In Proc. of the Int. Workshop on Worst-Case Execution Time Analysis (OASIcs), Vol. 55. Schloss Dagstuhl, 1--10.

[12]

Christian Ferdinand and Reinhard Wilhelm. 1999. Efficient and Precise Cache Behavior Prediction for Real-Time Systems. Real-Time Syst. 17, 2-3 (Dec. 1999), 131--181. https://doi.org/10.1023/A:1008186323068

Digital Library

[13]

Sebastian Hahn and Jan Reineke. 2018. Design and Analysis of SIC: A Provably Timing-Predictable Pipelined Processor Core. In Proc. of Real-Time Systems Symposium (RTSS '18). 469--481. https://doi.org/10.1109/RTSS.2018.00060

[14]

Stefan Hepp and Florian Brandner. 2014. Splitting Functions into Single-entry Regions. In Proc. of the Int. Conference on Compilers, Architecture and Synthesis for Embedded Systems (CASES '14). ACM, 17:1-17:10. https://doi.org/10.1145/2656106.2656128

Digital Library

[15]

B. Huber, S. Hepp, and M. Schoeberl. 2014. Scope-Based Method Cache Analysis. In Int. Workshop on Worst-Case Execution Time Analysis (OASIcs), Vol. 39. Schloss Dagstuhl, 73--82.

[16]

Bach Khoa Huynh, Lei Ju, and Abhik Roychoudhury. 2011. Scope-Aware Data Cache Analysis for WCET Estimation. In Proc. of the Real-Time and Embedded Technology and Applications Symposium (RTAS '11). IEEE, 203--212. https://doi.org/10.1109/RTAS.2011.27

Digital Library

[17]

A. Jordan, F. Brandner, and M. Schoeberl. 2013. Static Analysis of Worst-case Stack Cache Behavior. In Proc. of the Conf. on Real-Time Networks and Systems (RTNS '13). ACM, 55--64.

[18]

Uday Khedker, Amitabha Sanyal, and Bageshri Karkare. 2009. Data Flow Analysis: Theory and Practice (1st ed.). CRC Press.

[19]

Yau-Tsun Steven Li and Sharad Malik. 1995. Performance Analysis of Embedded Software using Implicit Path Enumeration. In Proc. of the Design Automation Conference (DAC '95). ACM, 456--461. https://doi.org/10.1145/217474.217570

Digital Library

[20]

Mingsong Lv, Nan Guan, Jan Reineke, Reinhard Wilhelm, and Wang Yi. 2016. A Survey on Static Cache Analysis for Real-Time Systems. Leibniz Transactions on Embedded Systems 3, 1 (2016), 05-1-05:48. https://doi.org/10.4230/LITES-v003-i001-a005

[21]

Shin-ichi Minato. 1993. Zero-suppressed BDDs for Set Manipulation in Combinatorial Problems. In Proc. of the International Design Automation Conference (DAC '93). ACM, 272--277. https://doi.org/10.1145/157485.164890

Digital Library

[22]

Alan Mishchenko. 2001. An introduction to zero-suppressed binary decision diagrams. Technical Report. University of California, Berkeley.

[23]

Frank Mueller. 1994. Static Cache Simulation and its Applications. Ph.D. Dissertation. Florida State University.

Digital Library

[24]

Frank Mueller. 2000. Timing Analysis for Instruction Caches. Real-Time Syst. 18, 2/3 (May 2000), 217--247. https://doi.org/10.1023/A:1008145215849

Digital Library

[25]

Kartik Nagar and Y. N. Srikant. 2017. Refining Cache Behavior Prediction Using Cache Miss Paths. ACM Trans. Embed. Comput. Syst. 16, 4, Article 103 (May 2017), 26 pages. https://doi.org/10.1145/3035541

Digital Library

[26]

A. Naji and F. Brandner. 2015. A Comparative Study of the Precision of Stack Cache Occupancy Analyses. In Proc. of the Junior Researcher Workshop on Real-Time Computing (JRWRTC '15). 13--16.

[27]

Kaustubh Patil, Kiran Seth, and Frank Mueller. 2004. Compositional Static Instruction Cache Simulation. In Proc. of the Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES '04). ACM, 136--145. https://doi.org/10.1145/997163.997183

Digital Library

[28]

Peter P. Puschner and Anton V. Schedl. 1997. Computing Maximum Task Execution Times - A Graph-Based Approach. Real-Time Systems 13, 1 (July 1997), 67--91. https://doi.org/10.1023/A:1007905003094

Digital Library

[29]

Abdur Rakib, Oleg Parshin, Stephan Thesing, and Reinhard Wilhelm. 2004. Component-Wise Instruction-Cache Behavior Prediction. In Proc. of Automated Technology for Verification and Analysis (ATVA '04). Springer, 211--229.

[30]

M. Schoeberl, F. Brandner, S. Hepp, W. Puffitsch, and Prokesch D. 2013. Patmos Reference Handbook. Technical University of Denmark. http://patmos.compute.dtu.dk/patmos_handbook.pdf

[31]

Martin Schoeberl, Wolfgang Puffitsch, Stefan Hepp, Benedikt Huber, and Daniel Prokesch. 2018. Patmos: A Time-predictable Microprocessor. Real-Time Syst. 54, 2 (April 2018), 389--423. https://doi.org/10.1007/s11241-018-9300-4

Digital Library

[32]

Martin Schoeberl, Pascal Schleuniger, Wolfgang Puffitsch, Florian Brandner, Christian W. Probst, Sven Karlsson, and Tommy Thorn. 2011. Towards a Time-predictable Dual-Issue Microprocessor: The Patmos Approach. In Proc. of Bringing Theory to Practice: Predictability and Performance in Embedded Systems, Vol. 18. OASICS, 11--21.

[33]

Ingmar Jendrik Stein. 2010. ILP-based Path Analysis on Abstract Pipeline State Graphs. Ph.D. Dissertation. Universität des Saarlandes.

[34]

H. Theiling and C. Ferdinand. 1998. Combining Abstract Interpretation and ILP for Microarchitecture Modelling and Program Path Analysis. In Proc. of the Real-Time Systems Symposium (RTSS '98). IEEE, 144--153.

[35]

Valentin Touzeau, Claire Maïza, David Monniaux, and Jan Reineke. 2017. Ascertaining Uncertainty for Efficient Exact Cache Analysis. In Computer Aided Verification (CAV '17). Springer, 22--40.

[36]

Valentin Touzeau, Claire Maïza, David Monniaux, and Jan Reineke. 2019. Fast and Exact Analysis for LRU Caches. Proc. ACM Program. Lang. 3, POPL, Article 54 (Jan. 2019), 29 pages. https://doi.org/10.1145/3290367

Digital Library

Cited By

Touzeau VReineke J(2023)Leveraging LLVM's ScalarEvolution for Symbolic Data Cache Analysis2023 IEEE Real-Time Systems Symposium (RTSS)10.1109/RTSS59052.2023.00029(237-250)Online publication date: 5-Dec-2023
https://doi.org/10.1109/RTSS59052.2023.00029
Brandner FNoûs C(2022)Precise, efficient, and context-sensitive cache analysisReal-Time Systems10.1007/s11241-021-09372-558:1(36-84)Online publication date: 1-Mar-2022
https://dl.acm.org/doi/10.1007/s11241-021-09372-5

Index Terms

Precise and Efficient Analysis of Context-Sensitive Cache Conflict Sets
1. Computer systems organization
  1. Real-time systems
2. Software and its engineering
  1. Software creation and management
    1. Software verification and validation
      1. Formal software verification
  2. Software organization and properties
    1. Software functional properties
      1. Formal methods
        Automated static analysis

Recommendations

Precise, efficient, and context-sensitive cache analysis
Abstract
Bounding the Worst-Case Execution Time (WCET) of real-time software requires precise knowledge about the reachable program and hardware states that might be observed at runtime. The analysis of precise cache states is particularly important and ...
Cache Exclusivity and Sharing: Theory and Optimization

A problem on multicore systems is cache sharing, where the cache occupancy of a program depends on the cache usage of peer programs. Exclusive cache hierarchy as used on AMD processors is an effective solution to allow processor cores to have a large ...
Modeling the function cache for worst-case execution time analysis
DAC '07: Proceedings of the 44th annual Design Automation Conference

Static worst-case execution time (WCET) analysis is done by modeling the hardware behavior. In this paper we describe a WCET analysis technique to analyze systems with function caches, a special kind of instruction cache that caches whole functions ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

RTNS '20: Proceedings of the 28th International Conference on Real-Time Networks and Systems

June 2020

177 pages

ISBN:9781450375931

DOI:10.1145/3394810

General Chairs:
Liliana Cucu-Grosjean
INRIA, Paris, France
,
Roberto Medina
INRIA, Paris, France
,
Program Chairs:
Sebastian Altmeyer
University of Augsburg, Germany
,
Jean-Luc Scharbarg
University of Toulouse, France

Copyright © 2020 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

In-Cooperation

INRIA: INRIA Saclay Île-de-France

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 June 2020

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

RTNS 2020

RTNS 2020: 28th International Conference on Real-Time Networks and Systems

June 9 - 10, 2020

Paris, France

Acceptance Rates

Overall Acceptance Rate 119 of 255 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
79
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)1

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Touzeau VReineke J(2023)Leveraging LLVM's ScalarEvolution for Symbolic Data Cache Analysis2023 IEEE Real-Time Systems Symposium (RTSS)10.1109/RTSS59052.2023.00029(237-250)Online publication date: 5-Dec-2023
https://doi.org/10.1109/RTSS59052.2023.00029
Brandner FNoûs C(2022)Precise, efficient, and context-sensitive cache analysisReal-Time Systems10.1007/s11241-021-09372-558:1(36-84)Online publication date: 1-Mar-2022
https://dl.acm.org/doi/10.1007/s11241-021-09372-5

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents