Efficient Cache Designs for Probabilistically Analysable Real-Time Systems

DOI10.1109/TC.2013.182zbMATH Open1364.68165OpenAlexW2080472262WikidataQ59421661 ScholiaQ59421661MaRDI QIDQ5267319

Jaume Abella, Eduardo Quiñones, Francisco J. Cazorla, Leonidas Kosmidis

Publication date: 20 June 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2013.182

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (4)

TACLC: Timing-Aware Cache Leakage Control for Hard Real-Time Systems ⋮ 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 ⋮ DMAC: Deadline-Miss-Aware Control

This page was built for publication: Efficient Cache Designs for Probabilistically Analysable Real-Time Systems

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