Bounding Worst-Case Data Cache Behavior by Analytically Deriving Cache Reference Patterns
- 1 April 2005
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Let's study whole-program cache behaviour analyticallyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Automatic analytical modeling for the estimation of cache missesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Timing analysis for data caches and set-associative cachesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Exact analysis of the cache behavior of nested loopsPublished by Association for Computing Machinery (ACM) ,2001
- A Comparison of Static Analysis and Evolutionary Testing for the Verification of Timing ConstraintsReal-Time Systems, 2001
- A Fast and Accurate Approach to Analyze Cache Memory BehaviorPublished by Springer Nature ,2000
- Timing Analysis for Instruction CachesReal-Time Systems, 2000
- Cache miss equationsACM Transactions on Programming Languages and Systems, 1999
- Timing Analysis for Data and Wrap-Around Fill CachesReal-Time Systems, 1999
- A data locality optimizing algorithmPublished by Association for Computing Machinery (ACM) ,1991