Improving time-randomized cache design
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/124984
Tipus de documentText en actes de congrés
Data publicació2018-04-24
EditorBarcelona Supercomputing Center
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
Enabling timing analysis for caches has been pursued by the critical real-time embedded systems (CRTES) community for years due to their potential to reduce worstcase execution times (WCET). Measurement-based protabilistic timing analysis (MBPTA) techniques have emerged as a solution to time-analyze complex hardware including caches, as long as they implement some random policies. Existing random placement and replacement policies have been proven efficient to some extent for single-level caches. However, they may lead to some probabilistic pathological eviction scenarios. In this work we propose new random placement and replacement policies specifically tailored for multi-level caches and for avoiding any type of pathological case.
CitacióBenedicte Illescas, P. [et al.]. Improving Time-Randomized Cache Design. A: BSC Severo Ochoa International Doctoral Symposium (5th: 2018: Barcelona). "Book of abstracts". Barcelona: Barcelona Supercomputing Center, 2018, p. 64-65.
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
27-IMPROVING TIME-RANDOMIZED.pdf | 799,2Kb | Visualitza/Obre |