On the analysis of random replacement caches using static probabilistic timing methods for multi-path programs

DOI10.1007/s11241-017-9295-2zbMath1484.68035OpenAlexW2776537683WikidataQ59603721 ScholiaQ59603721MaRDI QIDQ1645219

Liliana Cucu-Grosjean, Sebastian Altmeyer, Robert I. Davis, David Griffin, Benjamin Lesage

Publication date: 28 June 2018

Published in: Real-Time Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11241-017-9295-2

zbMATH Keywords

multi-pathprobabilistic timing analysiscache analysisrandom replacement policy

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

On the analysis of random replacement caches using static probabilistic timing methods for multi-path programs

Uses Software

• pwcet
• SPEC Benchmarks

Cites Work

• Stochastic analysis of real-time systems under preemptive priority-driven scheduling
• On the analysis of random replacement caches using static probabilistic timing methods for multi-path programs
• Static probabilistic timing analysis for real-time systems using random replacement caches
• Cache behavior prediction by abstract interpretation
• Efficient Cache Designs for Probabilistically Analysable Real-Time Systems

This page was built for publication: On the analysis of random replacement caches using static probabilistic timing methods for multi-path programs