Work

Probabilistic timing analysis on conventional cache designs

Year: 2013

Type: article

Abstract: —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. I.

DOI: 10.5555/2485288.2485435

Authors: Leonidas Kosmidis, Charlie Curtsinger, Eduardo Quiñones, Jaume Abella, Emery D. Berger, Francisco J. Cazorla

Institutions: Barcelona Supercomputing Center, Universitat Politècnica de Catalunya, University of Massachusetts Amherst, Consejo Superior de Investigaciones Científicas, Artificial Intelligence Research Institute

Language: English

Topic: Real-Time Systems Scheduling

Subfield: Hardware and Architecture

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1992905533

FWCI: 11.95

Cites: 18

Cited by: 45

Related to: 10