You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

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

Fulltext:


Authors:

Reinhard Wilhelm , Jakob Engblom , Andreas Ermedahl, Niklas Holsti , Stephan Thesing , David Whalley , Guillem Bernat , Christian Ferdinand , Reinhold Heckmann , Tulika Mitra , Frank Muller , Isabelle Puaut , Peter Puschner , Jan Staschulat , Per Stenström

Research group:


Publication Type:

Journal article

Venue:

ACM Transactions on Embedded Computing Systems (TECS)

Publisher:

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

@article{Wilhelm1258,
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},
volume = {7},
number = {3},
pages = {1--53},
month = {April},
year = {2008},
journal = {ACM Transactions on Embedded Computing Systems (TECS)},
publisher = {ACM},
url = {http://www.es.mdh.se/publications/1258-}
}