PACO: fast average-performance estimation for time-randomized caches
Authors: 
Suzana Milutinovic, Eduardo Quiñones, Jaume Abella, 
Francisco J. CazorlaAuthors Info & Claims
Suzana Milutinovic, Eduardo Quiñones, Jaume Abella, Francisco J. CazorlaAuthors Info & ClaimsArticle No.: 124, Pages 1 - 6
Abstract
Probabilistic timing analysis is a powerful approach to derive worst-case execution time (WCET) estimates, as needed in safety-critical systems, in the presence of high-performance hardware features (e.g., caches). To that end, the timing behavior of certain hardware resources, such as caches, is randomized. Time-randomized (TR) caches allow deriving hit/miss probabilities for each access and probabilistic WCET estimates for the overall program.
However, the analysis of the average performance of TR caches, which is needed for lowly-critical high-performance tasks in mixed-criticality environments, has been neglected. So far, average performance of a TR cache can only be analyzed through simulation, whose accuracy strongly depends on carrying a large number of simulations. In this paper we address this challenge by proposing PACO, an accurate analytical approach to estimate cache hit/miss probabilities of full applications, parts of them and individual cache accesses at low cost for a wide variety of TR cache hierarchies and setups.
References
[1]
J. Abella et al. Heart of gold: Making the improbable happen to extend coverage in probabilistic timing analysis. In ECRTS, 2014.
[2]
J. Abella et al. On the comparison of deterministic and probabilistic WCET estimation techniques. In ECRTS, 2014.
[3]
A. Agarwal et al. An analytical cache model. ACM Trans. Comput. Syst., 7(2), May 1989.
[4]
S. Altmeyer and R. I. Davis. On the correctness, optimality and precision of static probabilistic timing analysis. In DATE, 2014.
[5]
G. Bernat, A. Colin, and J. Esteves. Considerations on the LEON cache effects on the timing analysis of on-board applications. In DASIA, 2007.
[6]
G. Bernat, A. Colin, and S. M. Petters. WCET analysis of probabilistic hard real-time systems. In RTSS, 2002.
[7]
F. J. Cazorla et al. PROARTIS: Probabilistically analyzable real-time systems. ACM Trans. on Embedded Computing Systems, 12(2s), 2013.
[8]
L. Cucu-Grosjean et al. Measurement-based probabilistic timing analysis for multi-path programs. In ECRTS, 2012.
[9]
R. I. Davis et al. Analysis of probabilistic cache related pre-emption delays. In ECRTS, 2013.
[10]
C. Ferdinand and R. Wilhelm. Fast and Efficient Cache Behavior Prediction for Real-Time Systems. Real-Time System Journal, XVII:131--181, 1999.
[11]
C. Ferdinand et al. Reliable and precise WCET determination for a real-life processor. In EMSOFT, 2001.
[12]
J. Hansen, S. Hissam, and G. A. Moreno. Statistical-based WCET estimation and validation. In WCET Workshop, 2009.
[13]
D. Hardy and I. Puaut. WCET analysis of multi-level non-inclusive set-associative instruction caches. In RTSS, 2008.
[14]
P. J. Joseph et al. A predictive performance model for superscalar processors. In MICRO, 2006.
[15]
L. Kosmidis et al. A cache design for probabilistically analysable real-time systems. In DATE, 2013.
[16]
L. Kosmidis et al. Multi-level unified caches for probabilistically time analysable real-time systems. In RTSS, 2013.
[17]
B. Lesage, D. Hardy, and I. Puaut. WCET analysis of multi-level set-associative data caches. In WCET Workshop, 2009.
[18]
E. Mezzetti et al. Randomized caches can be pretty useful to hard real-time systems. LITES, 2(1), 2015.
[19]
F. Mueller. Predicting instruction cache behavior. Language, Compilers and Tools for Real-Time Systems, 1994.
[20]
F. Mueller. Timing analysis for instruction caches. Real-Time Systems Journal - Special issue on worst-case execution-time analysis, 2000.
[21]
M. Patte and V. Lefftz. System impact of distributed multi core systems. Technical Report ESTEC Contract 4200023100, European Space Agency, 2011.
[22]
J. Poovey. Characterization of the EEMBC Benchmark Suite. North Carolina State University, 2007.
[23]
PROXIMA. EU-FP7 Project: www.proxima-project.eu.
[24]
J. Reineke. Randomized caches considered harmful in hard real-time systems. LITES, 1(1), 2014.
[25]
G. E. Suh et al. Analytical cache models with applications to cache partitioning. In ICS, 2001.
[26]
F. Wartel et al. Measurement-based probabilistic timing analysis: Lessons from an integrated-modular avionics case study. In SIES, 2013.
[27]
F. Wartel et al. Timing analysis of an avionics case study on complex hardware/software platforms. In DATE, 2015.
[28]
R. Wilhelm et al. The worst-case execution time problem: overview of methods and survey of tools. Trans. on Embedded Comp. Systems, 7(3):1--53, 2008.
[29]
S. Zhou. An efficient simulation algorithm for cache of random replacement policy. In NPC, 2010.
Index Terms
- PACO: fast average-performance estimation for time-randomized caches
Recommendations
TLB Improvements for Chip Multiprocessors: Inter-Core Cooperative Prefetchers and Shared Last-Level TLBs
Translation Lookaside Buffers (TLBs) are critical to overall system performance. Much past research has addressed uniprocessor TLBs, lowering access times and miss rates. However, as Chip MultiProcessors (CMPs) become ubiquitous, TLB design and ...
High performance cache replacement using re-reference interval prediction (RRIP)
ISCA '10Practical cache replacement policies attempt to emulate optimal replacement by predicting the re-reference interval of a cache block. The commonly used LRU replacement policy always predicts a near-immediate re-reference interval on cache hits and ...
Comments
Information & Contributors
Information
Published In
June 2015
1204 pages
ISBN:9781450335201
DOI:10.1145/2744769
Copyright © 2015 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 ACM 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]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 07 June 2015
Check for updates
Qualifiers
- Research-article
Funding Sources
Conference
DAC '15
Sponsor:
DAC '15: The 52nd Annual Design Automation Conference 2015
June 7 - 11, 2015
California, San Francisco
Acceptance Rates
Overall Acceptance Rate 1,770 of 5,499 submissions, 32%
Upcoming Conference
DAC '25
- Sponsor:
- sigda
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 68Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 21 Sep 2024
Other Metrics
Citations
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.
Sign in