The worst-case execution-time problem-overview of methods and survey of tools
| Autor: | Frank Mueller, Christian Ferdinand, Niklas Holsti, Guillem Bernat, Isabelle Puaut, Reinhard Wilhelm, Jakob Engblom, Reinhold Heckmann, David Whalley, Jan Staschulat, Andreas Ermedahl, Stephan Thesing, Tulika Mitra, Per Stenström, Peter Puschner |
|---|---|
| Rok vydání: | 2008 |
| Předmět: |
Computer science
Probabilistic timing analysis Process (computing) 020207 software engineering 02 engineering and technology Parallel computing Branch predictor 020202 computer hardware & architecture Microarchitecture Pipeline transport Worst-case execution time Computer engineering Hardware and Architecture 0202 electrical engineering electronic engineering information engineering Software |
| Zdroj: | ACM Transactions on Embedded Computing Systems |
| ISSN: | 1539-9087 |
| DOI: | 10.1145/1347375.1347389 |
| Popis: | 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 1 and research prototypes. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|