Improving time-randomized cache design
Document typeConference report
PublisherBarcelona Supercomputing Center
Rights accessOpen Access
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 efﬁcient 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 speciﬁcally tailored for multi-level caches and for avoiding any type of pathological case.
CitationBenedicte 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.