Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Aspects of Wcet Analysis
The Process of Wcet Analysis
Generic Wcet Analysis Framework
Methods
The Worst-Case Execution Trace
Calculation Methods
Back-Annotation of Results
Classification Criteria for Wcet Analysis Tools
How to Classify a Wcet Analysis Framework
Case Study
Summary and Conclusion
References
All Topics
Computer Science
Embedded Systems

Classification of WCET analysis techniques

Profile image of Raimund KirnerRaimund Kirner

2005, Object-Oriented Real-Time Distributed …

https://doi.org/10.1109/ISORC.2005.19
visibility

…

description

10 pages

link

1 file

Abstract
sparkles

AI

The paper presents a classification of various Worst-Case Execution Time (WCET) analysis techniques, addressing the crucial aspects of safe and tight result provision. It categorizes different methodologies based on their hardware modeling approaches, control flow behavior specification, and automation levels. Furthermore, it introduces a systematic evaluation scheme for assessing the applicability of WCET analysis tools under diverse requirements, illustrated through case studies.

Related papers

The worst-case execution time tool challenge 2006
Jan Gustafsson

International Journal on Software Tools for Technology Transfer, 2009

The first international Worst Case Execution Time (WCET) Tool Challenge in 2006 used benchmark programs to evaluate academic and commercial WCET tools. It aimed to study the state-of-the-art in WCET analysis. The WCET Tool Challenge comprised two parallel evaluation approaches: an internal evaluation by the respective tool developers and an external test by a neutral person of an independent institute. The latter was conducted by the author of this paper. Focusing on the external test, we describe the rules, benchmarks, participants and discuss the obtained results.

View PDFchevron_right
Measurement-based worst-case execution time analysis
Raimund Kirner

2005

View PDFchevron_right
A Unified WCET analysis framework for multicore platforms
Peter Marwedel

ACM Transactions on Embedded Computing Systems, 2014

With the advent of multi-core architectures, worst case execution time (WCET) analysis has become an increasingly difficult problem. In this paper, we propose a unified WCET analysis framework for multi-core processors featuring both shared cache and shared bus. Compared to other previous works, our work differs by modeling the interaction of shared cache and shared bus with other basic micro-architectural components (e.g. pipeline and branch predictor). In addition, our framework does not assume a timing anomaly free multicore architecture for computing the WCET. A detailed experiment methodology suggests that we can obtain reasonably tight WCET estimates in a wide range of benchmark programs.

View PDFchevron_right
The worst-case execution-time problem—overview of methods and survey of tools
Peter Puschner

ACM Transactions on Embedded Computing Systems, 2008

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.

View PDFchevron_right
Supporting Control-Flow-Dependent Execution Times on WCET Calculation
Raimund Kirner

Deutschsprachige WCET-Tagung

View PDFchevron_right
A machine independent WCET predictor for microcontrollers and DSPs [worst case execution time]
Carlos Alberto Caridade Monteiro Couto

Journal of Molecular Catalysis A-chemical, 2001

This paper describes a method for analyzing and predicting the timing properties of a program fragment. The paper first presents a language implemented to describe a processor's architecture and a static worst case execution time (WCET) estimation method is then presented. The timing analysis starts by compiling a processor's architecture program followed by the disassembling of the program fragment. The

View PDFchevron_right
The influence of processor architecture on the design and the results of WCET tools
Reinhold Heckmann

Proceedings of the IEEE, 2003

The architecture of tools for the determination of worst case execution times (WCETs) as well as the precision of the results of WCET analyses strongly depend on the architecture of the employed processor. The cache replacement strategy influences the results of cache behavior prediction; out-of-order execution and control speculation introduce interferences between processor components, e.g., caches, pipelines, and branch prediction units. These interferences forbid modular designs of WCET tools, which would execute the subtasks of WCET analysis consecutively. Instead, complex integrated designs are needed, resulting in high demand for memory space and analysis time. We have implemented WCET tools for a series of increasingly complex processors: SuperSPARC, Motorola ColdFire 5307, and Motorola PowerPC 755. In this paper, we describe the designs of these tools, report our results and the lessons learned, and give some advice as to the predictability of processor architectures.

View PDFchevron_right
WCET analysis of modern processors using multi-criteria optimisation
Usman Khan

Empirical Software Engineering, 2011

The Worst-Case Execution Time (WCET) is an important execution metric for real-time systems, and an accurate estimate for this increases the reliability of subsequent schedulability analysis. Performance enhancing features on modern processors, such as pipelines and caches, however, make it difficult to accurately predict the WCET. One technique for finding the WCET is to use test data generated using search

View PDFchevron_right

References (35)

  1. A. W. Appel. Modern Compiler Implementation in C. Press Syndicate of the University of Cambridge, 1999. ISBN 0- 521-58390-X.
  2. R. D. Arnold, F. Mueller, D. Whalley, and M. Harmon. Bounding Worst-Case Instruction Cache Performance. In Proc. 15th Real-Time Systems Symposium (RTSS), pages 172-181, Brookline, Massachusetts, Dec. 1994.
  3. P. Atanassov, R. Kirner, and P. Puschner. Using real hard- ware to create an accurate timing model for execution-time analysis. In International Workshop on Real-Time Embed- ded Systems RTES (in conjunction with 22nd IEEE RTSS 2001), London, UK, Dec. 2001.
  4. P. Atanassov and P. Puschner. Impact of dram refresh on the execution time of real-time tasks. In International Workshop on Application of Reliable Computing and Communication (WARCC), Dec. 2001.
  5. G. Bernat and A. Burns. An approach to Symbolic Worst- Case Execution Time Analysis. In Proc. 25th Workshop on Real-Time programming, Palma, Spain, May 2000.
  6. G. Bernat, A. Burns, and A. Wellings. Portable Worst-Case Execution Time Analysis using Java Byte Code. In Proc. 6th International EUROMICRO conference on Real-Time Sys- tems, Stockholm, June 2000.
  7. J. Blieberger. Data-flow frameworks for worst-case execu- tion time analysis. Real-Time Systems, 22:183-227, 2002.
  8. A. Colin and I. Puaut. Worst case execution time analysis for a processor with branch prediction. RTS, 18(2):249-274, May 2000.
  9. A. Colin and I. Puaut. A modular and retargetable frame- work for tree-based wcet analysis. In Proc. 13th Euromi- cro Conference on Real-Time Systems, pages 37-44, Delft, Netherland, June 2001. Technical University of Delft.
  10. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construc- tion or approximation of fixpoints. In Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 238-252, Los Angeles, California, 1977. ACM Press, New York, NY.
  11. J. Engblom. Processor Pipelines and Static Worst-Case Ex- ecution Time Analysis. PhD thesis, Acta Universitatis Up- saliensis, Uppsala, Sweden, Apr. 2002.
  12. J. Engblom and A. Ermedahl. Modeling complex flows for worst-case execution time analysis. In Proc. 21st IEEE Real- Time Systems Symposium (RTSS), Orlando, Florida, USA, Dec. 2000.
  13. E. Erpenbach and P. Altenbernd. Worst-Case Execution Times and Schedulability Analysis of Statecharts Models. In Proc. 11th Euromicro Conference on Real Time Systems, York, June 1999.
  14. C. Ferdinand, R. Heckmann, M. Langenbach, F. Martin, M. Schmidt, H. Theiling, S. Thesing, and R. Wilhelm. Reli- able and precise WCET determination for a real-life proces- sor. In Proc. of the 1st International Workshop on Embedded Software (EMSOFT 2001), pages 469-485, Tahoe City, CA, USA, Oct. 2001.
  15. J. Gustafsson. Analysing Execution-Time of Object-Oriented Programs Using Abstract Interpretation. PhD thesis, Upp- sala University, Uppsala, Sweden, May 2000.
  16. D. Harel and A. Naamad. The STATEMATE Semantics of Statecharts. ACM Transactions on Software Engineering and Methodology (TOSEM), 5(4), Oct. 1996.
  17. C. A. Healy, R. D. Arnold, F. Mueller, D. Whalley, and M. G. Harmon. Bounding Pipeline and Instruction Cache Performance. IEEE Transactions on Computers, 48(1), Jan. 1999.
  18. C. A. Healy, M. Sjödin, and D. B. Whalley. Bounding Loop Iterations for Timing Analysis. In Proc. IEEE Real-Time Technology and Aplications Symposium, pages 12-21, June 1998.
  19. R. Kirner. Extending Optimising Compilation to Support Worst-Case Execution Time Analysis. PhD thesis, Technis- che Universität Wien, Vienna, Austria, May 2003.
  20. R. Kirner, R. Lang, G. Freiberger, and P. Puschner. Fully automatic worst-case execution time analysis for Mat- lab/Simulink models. In Proc. 14th Euromicro Conference on Real-Time Systems, pages 31-40, Vienna, Austria, June 2002. Vienna University of Technology, IEEE.
  21. E. Klingerman and A. D. Stoyenko. Real-Time Euclid: A Language for Reliable Real-Time Systems. IEEE Transac- tions on Software Engineering, 12(9):941-989, Sep. 1986.
  22. Y.-T. S. Li, S. Malik, and A. Wolfe. Efficient Microarchitec- ture Modeling and Path Analysis for Real-Time Software. In Proc. IEEE Real-Time Systems Symposium, pages 298-307, Dec. 1995.
  23. Y.-T. S. Li, S. Malik, and A. Wolfe. Cache modeling for real- time software: Beyond direct mapped instruction caches. In Proc. 17th Real-Time Systems Symposium, pages 254-263. IEEE, Dec. 1996.
  24. Z. Manna. Mathematical Theory of Computation. McGraw- Hill, 1974.
  25. C. Y. Park. Predicting Program Execution Times by Analyz- ing Static and Dynamic Program Paths. Real-Time Systems, 5(1):31-62, 1993.
  26. C. Y. Park and A. C. Shaw. Experiments with a Program Timing Tool based on a Source-Level Timing Schema. Com- puter, 24(5):48-57, May 1991.
  27. P. Puschner. Ermittlung der maximalen Abarbeitungszeit von Programmen. Master's thesis, Technische Universität Wien, Vienna, Sep. 1988.
  28. P. Puschner and A. Burns. A Review of Worst-Case Execution-Time Analysis. Journal of Real-Time Systems, 18(2/3):115-128, May 2000.
  29. P. Puschner and C. Koza. Calculating the Maximum Execu- tion Time of Real-Time Programs. The Journal of Real-Time Systems, 1:159-176, 1989.
  30. P. Puschner and A. V. Schedl. A Tool for the Computation of the Worst Case Task Execution Times. In Proc. Euromi- cro Workshop on Real-Time Systems, pages 224-229, Oulu, Finland, June 1993.
  31. P. Puschner and A. V. Schedl. Computing Maximum Task Execution Times -A Graph-Based Approach. The Journal of Real-Time Systems, 13:67-91, 1997.
  32. E. Rohou, F. Bodin, and A. Seznec. Salto: System for assembly-language transformation and optimization. In Proc. 6th Workshop on Compilers for Parallel Computers, Dec. 1996.
  33. F. Stappert and P. Altenbernd. Complete worst-case execu- tion time analysis of straight-line hard real-time programs. Journal of Systems Architecture, 46(4):339-355, 2000.
  34. A. Vrchoticky. Compilation Support for Fine-Grained Ex- ecution Time Analysis. In Proc. ACM SIGPLAN Workshop on Language, Compiler and Tool Support for Real-Time Sys- tems, Orlando FL, June 1994.
  35. R. T. White, F. Mueller, C. A. Healy, D. B. Whalley, and M. G. Harmon. Timing analysis for data caches and set- associative caches. In Proc. Real-Time Technology and Ap- plications Symposium, pages 192-202, June 1997.

Related papers

Obstacles in worst-case execution time analysis
Raimund Kirner

11th IEEE Symposium on Object Oriented …, 2008

View PDFchevron_right
WCET 2008--Report from the Tool Challenge 2008--8th Intl. Workshop on Worst-Case Execution Time (WCET) Analysis}
Armelle Bonenfant

8th Intl. Workshop on Worst-Case Execution Time (WCET) Analysis}, 2008

Following the successful WCET Tool Challenge in 2006, the second event in this series was organized in 2008, again with support from the ARTIST2 Network of Excellence. The WCET Tool Challenge 2008 (WCC'08) provides benchmark programs and poses a number of "analysis problems" about the dynamic, runtime properties of these programs. The participants are challenged to solve these problems with their programanalysis tools. Two kinds of problems are defined: WCET problems, which ask for bounds on the execution time of chosen parts (sub programs) of the benchmarks, under given constraints on input data; and flowanalysis problems, which ask for bounds on the number of times certain parts of the benchmark can be executed, again under some constraints. We describe the organization of WCC'08, the benchmark programs, the participating tools, and the general results, successes, and failures. Most participants found WCC'08 to be a useful test of their tools. Unlike the 2006 Challenge, the WCC'08 participants include several tools for the same target (ARM7, LPC2138), and tools that combine measurements and static analysis, as well as pure staticanalysis tools.

View PDFchevron_right
Classification of code annotations and discussion of compiler-support for worst-case execution time analysis
Raimund Kirner

Proc. 5th International Workshop on Worst-Case …, 2005

View PDFchevron_right
8th International Workshop on Worst-Case Execution Time Analysis
Raimund Kirner

2008

Following the successful WCET Tool Challenge in 2006, the second event in this series was organized in 2008, again with support from the ARTIST2 Network of Excellence. The WCET Tool Challenge 2008 (WCC'08) provides benchmark programs and poses a number of "analysis problems" about the dynamic, runtime properties of these programs. The participants are challenged to solve these problems with their programanalysis tools. Two kinds of problems are defined: WCET problems, which ask for bounds on the execution time of chosen parts (sub programs) of the benchmarks, under given constraints on input data; and flowanalysis problems, which ask for bounds on the number of times certain parts of the benchmark can be executed, again under some constraints. We describe the organization of WCC'08, the benchmark programs, the participating tools, and the general results, successes, and failures. Most participants found WCC'08 to be a useful test of their tools. Unlike the 2006 Challenge, the WCC'08 participants include several tools for the same target (ARM7, LPC2138), and tools that combine measurements and static analysis, as well as pure staticanalysis tools.

View PDFchevron_right
Predicated Worst-Case Execution-Time Analysis
Amine Marref

Reliable Software Technologies–Ada-Europe 2009, 2009

Knowledge about the Worst-Case Execution-Time (WCET) is of primordial importance in the validation of real-time systems. A WCET estimation must be safe and tight. Tightness in WCET estimation is highly desirable for an efficient utilisation of resources. In order to obtain accurate WCET values, more program execution-history must be accounted for. In this thesis we propose the use of Predicated WCET Analysis which uses constraint-logic programming to model context-sensitive execution-times of program segments. We prove that our predicated analysis is safe and very tight compared to contemporary analysis techniques.

View PDFchevron_right

Related topics

  • Real-time Systems
  • Worst-Case Execution Time Analysis
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved