The worst-case execution-time problem—overview of methods and survey of tools

Abstract

Abstract. The determination of upper bounds on execution times, commonly called WorstCase Execution Times (WCETs), is a necessary step in the development and validation process for hard real-time systems. This problem is hard if the underlying processor architecture has components such as caches, pipelines, branch prediction, and other speculative components. This article describes different approaches to this problem and surveys several commercially available tools and research prototypes.

Framework for cyber-physical systems: volume 3, timing annex

“…Selected articles and references are provided in Refs. [5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21].…”

Time-predictable memory arbitration for a Java chip-multiprocessor

“…Both Puschner and Burns [12], and Wilhelm et al [20] give a broad overview of the WCET research. Nevertheless, not all these achievements can be applied to multiprocessor systems.…”

“…It is the time a process could eventually need to execute under worst conditions on a given processor. In [20], Wilhelm et al define the goal of WCET analysis concerning the upper bounds of the execution time:…”

Formal Verification of Loop Bound Estimation for WCET Analysis

“…cache misses) and 3) estimate calculation; see [23] for a survey of techniques and tools. Sound estimate calculation computes an upper bound of all execution times of a whole program (i.e.…”