Probabilistic timing analysis on conventional cache designs
Document typeConference report
Rights accessRestricted access - publisher's policy
Probabilistic timing analysis (PTA), a promising alternative to traditional worst-case execution time (WCET) analyses, enables pairing time bounds (named probabilistic WCET or pWCET) with an exceedance probability (e.g., 10 -16), resulting in far tighter bounds than conventional analyses. However, the applicability of PTA has been limited because of its dependence on relatively exotic hardware: fully-associative caches using random replacement. This paper extends the applicability of PTA to conventional cache designs via a software-only approach. We show that, by using a combination of compiler techniques and runtime system support to randomise the memory layout of both code and data, conventional caches behave as fully-associative ones with random replacement.
CitationKosmidis, L. [et al.]. Probabilistic timing analysis on conventional cache designs. A: Design, Automation and Test in Europe. "DATE 13: Design, Automation and Test in Europe: Grenoble, France, March 18 - 22, 2013". Grenoble: 2013, p. 603-606.
|Probabilistic Timing Analysis.pdf||Probabilistic Timing Analysis.pdf||281.7Kb||Restricted access|