The worst-case execution-time problem—overview of methods and survey of tools
|
|
Full text:
|
 |
|
Authors:
|
Reinhard Wilhelm (external), Jakob Engblom (Virtutech, Sweden), Andreas Ermedahl (former), Niklas Holsti (Tidorum LTD), Stephan Thesing (external), David Whalley (external), Guillem Bernat (external), Christian Ferdinand (external), Reinhold Heckmann (external), Tulika Mitra (external), Frank Muller (external), Isabelle Puaut (external), Peter Puschner (external), Jan Staschulat (external), Per Stenström (external) |
|
Source:
|
ACM Transactions on Embedded Computing Systems (TECS), vol 7, nr 3, p1---53, ACM |
|
| |
Abstract
The determination of upper bounds on execution times, commonly called worst-case 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. |
| |
BibTeX entry
@article{Wilhelm_1485:2008,
author = {Reinhard Wilhelm and Jakob Engblom and Andreas Ermedahl and Niklas Holsti and Stephan Thesing and David Whalley and Guillem Bernat and Christian Ferdinand and Reinhold Heckmann and Tulika Mitra and Frank Muller and Isabelle Puaut and Peter Puschner and Jan Staschulat and Per Stenstr{\"o}m},
title = {The worst-case execution-time problem—overview of methods and survey of tools},
journal = {ACM Transactions on Embedded Computing Systems (TECS)},
volume = {7},
number = {3},
month = {April},
year = {2008},
pages = {1---53},
publisher = {ACM},
url = {http://www.mrtc.mdh.se/index.php?choice=publications&id=1485},
} |
