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

An Efficient Algorithm for Parametric WCET Calculation

Fulltext:


Authors:

Stefan Bygde, Andreas Ermedahl, Björn Lisper

Note:

<B>Best paper award</B>

Research group:

Programming Languages

Publication Type:

Conference/Workshop Paper

Venue:

The 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2009

Publisher:

IEEE Computer Society

Abstract

Static WCET analysis is a process dedicated to derive a safe upper bound of the worst-case execution time of a program. In many real-time systems, however, a constant global WCET estimate is not always so useful since a program may behave very differently depending on its configuration or mode. A parametric WCET analysis derives the upper bound as formula rather than a constant. This paper presents a new efficient algorithm that can obtain a safe parametric estimate of the WCET of a program. This algorithm is evaluated on a large set of benchmarks and compared to a previous approach to parametric WCET calculation. The evaluation shows that the new algorithm, to the cost of some imprecision, scales much better and can handle more realistic programs than the previous approach.

Bibtex

@inproceedings{Bygde1411,
author = {Stefan Bygde and Andreas Ermedahl and Bj{\"o}rn Lisper},
title = {An Efficient Algorithm for Parametric WCET Calculation},
note = {\textlessB\textgreaterBest paper award\textless/B\textgreater},
editor = {Patrick Kellenberger},
pages = {13--21},
month = {August},
year = {2009},
booktitle = {The 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2009},
publisher = {IEEE Computer Society},
url = {http://www.es.mdu.se/publications/1411-}
}