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.
%0 Journal Article
%1 overview2008
%A Wilhelm, Reinhard
%A Engblom, Jakob
%A Ermedahl, Andreas
%A Holsti, Niklas
%A Thesing, Stephan
%A Whalley, David B.
%A Bernat, Guillem
%A Ferdinand, Christian
%A Heckmann, Reinhold
%A Mitra, Tulika
%A Mueller, Frank
%A Puaut, Isabelle
%A Puschner, Peter P.
%A Staschulat, Jan
%A Stenström, Per
%D 2008
%J ACM Trans. Embedded Comput. Syst.
%K MAXT mgr todo_tags
%N 3
%T The Worst-Case Execution Time Problem — Overview of Methods and Survey of Tools
%U http://moss.csc.ncsu.edu/~mueller/ftp/pub/mueller/papers/1257.pdf
%V 7
%X 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.
@article{overview2008,
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.},
added-at = {2009-07-15T18:23:30.000+0200},
author = {Wilhelm, Reinhard and Engblom, Jakob and Ermedahl, Andreas and Holsti, Niklas and Thesing, Stephan and Whalley, David B. and Bernat, Guillem and Ferdinand, Christian and Heckmann, Reinhold and Mitra, Tulika and Mueller, Frank and Puaut, Isabelle and Puschner, Peter P. and Staschulat, Jan and Stenström, Per},
biburl = {https://www.bibsonomy.org/bibtex/27ed4b8824b020b35d0e9a110e12326d8/gwpl},
date = {2008-05-09},
ee = {http://doi.acm.org/10.1145/1347375.1347389},
interhash = {3622b9deb20ad541a91330c8be6c7223},
intrahash = {7ed4b8824b020b35d0e9a110e12326d8},
journal = {ACM Trans. Embedded Comput. Syst.},
keywords = {MAXT mgr todo_tags},
note = {http://dblp.uni-trier.de/db/journals/tecs/tecs7.html#WilhelmEEHTWBFHMMPPSS08},
number = 3,
timestamp = {2009-07-15T18:23:30.000+0200},
title = {The Worst-Case Execution Time Problem — Overview of Methods and Survey of Tools
},
url = {http://moss.csc.ncsu.edu/~mueller/ftp/pub/mueller/papers/1257.pdf},
volume = 7,
year = 2008
}