Timing predictability of cache replacement policies

DOI10.1007/S11241-007-9032-3zbMATH Open1125.68422OpenAlexW1979470295MaRDI QIDQ2460197FDOQ2460197

Authors: Jan Reineke, Daniel Grund, Christoph Berg, Reinhard Wilhelm 

Publication date: 14 November 2007

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

Full work available at URL: https://doi.org/10.1007/s11241-007-9032-3

Recommendations

• Abstract Interpretation of FIFO Replacement
• On the complexity of cache analysis for different replacement policies
• Static probabilistic timing analysis for real-time systems using random replacement caches
• On the analysis of random replacement caches using static probabilistic timing methods for multi-path programs
• Formal Methods for Components and Objects

zbMATH Keywords

Hard real-time systemsPredictabilityCache analysisCache replacement policiesTiming analysis

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Theory of software (68N99)

Cites Work

• Title not available (Why is that?)

Cited In (7)

• Impact of DM-LRU on WCET: A Static Analysis Approach
• Data cache organization for accurate timing analysis
• Memory-centric scheduling for multicore hard real-time systems
• Scalable and precise refinement of cache timing analysis via path-sensitive verification
• On the analysis of random replacement caches using static probabilistic timing methods for multi-path programs
• Caching with time windows
• Abstract Interpretation of FIFO Replacement

Uses Software

• SPEC Benchmarks

This page was built for publication: Timing predictability of cache replacement policies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2460197)