Cited By
View all- De Nicola RDi Stefano LInverso OUwimbabazi A(2022)Automated replication of tuple spaces via static analysisScience of Computer Programming10.1016/j.scico.2022.102863223:COnline publication date: 1-Nov-2022
RPR: a random replacement policy with limited pathological replacements
Pages 593 - 600
Abstract
Measurement-Based Probabilistic Timing Analysis (MBPTA) has consolidated as a technique to estimate probabilistic Worst-Case Execution Times (WCET) for critical software running on processors with high-performance hardware such as multilevel caches. Conventional random replacement (CRR) is the most suitable replacement policy for MBPTA due to its probabilistic nature: replacement choices are random and independent. CRR makes pathological replacement patterns probabilistic rather than systematic, though they can still occur. This paper proposes a new replacement policy, RPR, that keeps MBPTA compatibility and prevents CRR's pathological replacements in which addresses mapped to different cache lines randomly evict each other despite some lines in the same cache set are available. In particular, RPR maintains a higher degree of temporal locality than CRR. Our evaluation on a performance simulator (validated against a real industrial prototype) using the Mälardalen benchmarks and a railway case study shows that RPR delivers both high average performance (within 1% of LRU's performance) and tight WCET estimates 16% and 24% (for the case study and Mälardalen respectively) lower than those of CRR.
References
[1]
J. Abella et al. 2014. Heart of Gold: Making the Improbable Happen to Extend Coverage in Probabilistic Timing Analysis. In ECRTS.
[2]
J. Abella et al. 2015. WCET Analysis Methods: Pitfalls and Challenges on their Trustworthiness. In SIES.
[3]
J. Abella et al. 2017. Measurement-Based Worst-Case Execution Time Estimation Using the Coefficient of Variation. ACM Trans. Des. Autom. Electron. Syst. 22, 4 (June 2017), 72:1--72:29.
[4]
I. Agirre et al. 2015. IEC-61508 SIL 3 Compliant Pseudo-Random Number Generators for Probabilistic Timing Analysis. In DSD.
[5]
P. Alfke. 1996. Efficient Shift Registers, LFSR Counters, and Long Pseudo-Random Sequence Generators. Xilinx.
[6]
ARM. 2006. Cortex-R4 and Cortex-R4F Technical Reference Manual.
[7]
L. A. Belady. 1966. A study of replacement algorithms for a virtual-storage computer. IBM Systems Journal 5, 2 (1966), 78--101.
[8]
D. Buttle. 2012. ETAS GmbH, Germany, Real-Time in the Prime-Time. Keynote talk. In ECRTS.
[9]
M. Chaudhuri. 2009. Pseudo-LIFO: The foundation of a new family of replacement policies for last-level caches. In MICRO.
[10]
T. Chen, P. Liu, and K.C. Stelzer. 2006. Implementation of a pseudo-LRU algorithm in a partitioned cache. (2006). US Patent number 7,069,390.
[11]
COBHAM. {n. d.}. LEON3 Processor. Probabilistic platform. http://www.gaisler.com/index.php/products/processors/leon3. ({n. d.}).
[12]
Cobham Gaisler. 2011. Quad Core LEON4 SPARC V8 Processor - LEON4-NGMP-DRAFT - Data Sheet and Users Manual.
[13]
L. Cucu-Grosjean et al. 2012. Measurement-Based Probabilistic Timing Analysis for Multi-path Programs. In ECRTS.
[14]
E. Mezzetti and T. Vardanega. 2013. A rapid cache-aware procedure positioning optimization to favor incremental development. In RTAS.
[15]
Esterel Technologies, SA. 2006. Efficient Developement of Safe Avionics Software with DO-178B Objectives Using SCADE Suite - Methodological Handbook.
[16]
Freescale Semiconductor. 2005. MPC7450 RISC Microprocessor Family Reference Manual. Rev. 5. Freescale Semiconductor.
[17]
J. Gustafsson et al. 2010. The Mälardalen WCET Benchmarks-Past, Present and Future. In WCET Workshop.
[18]
C. Hernandez et al. 2016. Random Modulo: a New Processor Cache Design for Real-Time Critical Systems. In DAC.
[19]
International Electrotechnical Comission. 2009. IEC 61508, Functional Safety of Electrical/Electronic/Programmable Electronic Safety-related Systems, Edition 2.0.
[20]
International Organization for Standardization. 2009. ISO/DIS 26262. Road Vehicles - Functional Safety.
[21]
A. Jaleel et al. 2010. High Performance Cache Replacement Using Re-reference Interval Prediction (RRIP). In ISCA.
[22]
J. Jalle et al. 2014. Bus Designs for Time-Probabilistic Multicore Processors. In DATE.
[23]
J. Jalle et al. 2016. Validating a Timing Simulator for the NGMP Multicore Processor. In DASIA.
[24]
R. Karedla, J. S. Love, and B. G. Wherry. 1994. Caching strategies to improve disk system performance. Computer 27, 3 (1994), 38--46.
[25]
L. Kosmidis, D. Compagnin, D. Morales, E. Mezzetti, E. Quiñones, J. Abella, Tullio Vardanega, and F.J. Cazorla. 2016. Measurement-Based Timing Analysis of the AURIX Caches. In WCET.
[26]
L. Kosmidis, R. Vargas, D. Morales, E. Quiñones, J. Abella, and F. J. Cazorla. 2016. TASA: Toolchain Agnostic Software Randomisation for Critical Real-Time Systems. In ICCAD.
[27]
L. Kosmidis et al. 2013. A Cache Design for Probabilistically Analysable Real-time Systems. In DATE.
[28]
L. Kosmidis et al. 2013. Probabilistic Timing Analysis on Conventional Cache Designs. In DATE.
[29]
S. Kotz and S. Nadarajah. 2000. Extreme value distributions: theory and applications. World Scientific. 185 pages.
[30]
K. Lahiri, A. Raghunathan, and G. Lakshminarayana. 2001. LOTTERYBUS: a new high-performance communication architecture for system-on-chip designs. In Proceedings of the 38th annual Design Automation Conference (DAC '01). 15--20.
[31]
P. Machado et al. 2017. Probabilistic Timing Analysis on Time-Randomized Platforms for the Space Domain. In DATE.
[32]
J. Owens. 2015. Delphi Automotive, The Design of Innovation That Drives Tomorrow. Keynote talk. In DAC.
[33]
M.K. Qureshi et al. 2007. Adaptive Insertion Policies for High Performance Caching. In ISCA.
[34]
SoCLib. 2003-2012. -. (2003-2012). http://www.soclib.fr/trac/dev.
[35]
Z. Stephenson, J. Abella, and T. Vardanega. 2013. Supporting Industrial Use of Probabilistic Timing Analysis with Explicit Argumentation. In INDIN.
[36]
F. Wartel et al. 2013. Measurement-Based Probabilistic Timing Analysis: Lessons from an Integrated-Modular Avionics Case Study. In SIES.
[37]
F. Wartel et al. 2015. Timing Analysis of an Avionics Case Study on Complex Hardware/Software Platforms. In DATE.
[38]
R. Wilhelm et al. 2008. The worst-case execution-time problem overview of methods and survey of tools. ACM Transactions on Embedded Computing Systems 7 (May 2008), 1--53. Issue 3.
Recommendations
Introducing hierarchy-awareness in replacement and bypass algorithms for last-level caches
PACT '12: Proceedings of the 21st international conference on Parallel architectures and compilation techniquesThe replacement policies for the last-level caches (LLCs) are usually designed based on the access information available locally at the LLC. These policies are inherently sub-optimal due to lack of information about the activities in the inner-levels of ...
Performance evaluation of cache replacement policies for the SPEC CPU2000 benchmark suite
ACMSE '04: Proceedings of the 42nd annual ACM Southeast ConferenceReplacement policy, one of the key factors determining the effectiveness of a cache, becomes even more important with latest technological trends toward highly associative caches. The state-of-the-art processors employ various policies such as Random, ...
Cache partitioning for energy-efficient and interference-free embedded multitasking
We propose a technique that leverages configurable data caches to address the problem of energy inefficiency and intertask interference in multitasking embedded systems. Data caches are often necessary to provide the required memory bandwidth. However, ...
Comments
Information & Contributors
Information
Published In
April 2018
2327 pages
ISBN:9781450351911
DOI:10.1145/3167132
- Conference Chairs:
- Hisham M. Haddad,
- Roger L. Wainwright,
- Richard Chbeir
Copyright © 2018 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: 09 April 2018
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Spanish Ministry of Education, Culture and Sports
- Spanish Ministry of Economy and Competitiveness
Conference
SAC 2018
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,650 of 6,669 submissions, 25%
Upcoming Conference
SAC '25
- Sponsor:
- sigapp
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 86Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Mar 2025
Other Metrics
Citations
Cited By
View all- De Nicola RDi Stefano LInverso OUwimbabazi A(2022)Automated replication of tuple spaces via static analysisScience of Computer Programming10.1016/j.scico.2022.102863223:COnline publication date: 1-Nov-2022
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in