Open Access
Worst Case Execution Time Estimation for Advanced Processor Architectures
Stefan M. Petters
- 01 Jan 2002
40
TL;DR: A measurement based approach to estimate the worst case execution time on a fully featured processor, suitable for processors equipped with advanced acceleration techniques, and an existing extreme value statistic approach is extended, to handle combinations of measurements.
read more
Abstract: Advanced acceleration features, as they are used in todays mass market, high performance processors, have only been considered in isolation in previous worst case execution time estimation approaches. This thesis presents a measurement based approach to estimate the worst case execution time on a fully featured processor. To produce reliable results several aspects have to be considered. Prior to the start of a measurement, the acceleration techniques are preset, as far as possible, into their worst case state. The features, which cannot be controlled to produce the worst case state are either randomised or covered by penalties added to the measured results. All possible path combinations are enforced using additional instrumentation code. By partitioning the measurement problem into several measurement blocks, the coverage of all path combinations is ensured. To cover final uncertainty, an existing extreme value statistic approach is extended, to handle combinations of measurements. Additionally a scheduling analysis method, suitable for processors equipped with such acceleration techniques, is presented. A number of test cases, show the applicability and the limitations of the approach.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
WCET analysis of probabilistic hard real-time systems
Guillem Bernat,Antoine Colin,Stefan M. Petters +2 more
- 03 Dec 2002
TL;DR: This work combines both measurement and analytical approaches into a model for computing probabilistically bounds on the execution time of the worst case path of sections of code and introduces the notion of probabilistic hard real-time systems which have to meet all the deadlines but for which a (high) probabilism guarantee suffices.
404
Memory Hierarchies, Pipelines, and Buses for Future Architectures in Time-Critical Embedded Systems
Reinhard Wilhelm,Daniel Grund,Jan Reineke,Marc Schlickling,Markus Pister,Christian Ferdinand +5 more
TL;DR: The architectural influence on static timing analysis is described and recommendations as to profitable and unacceptable architectural features are given and results show that measurement-based methods still used in industry are not useful for quite commonly used complex processors.
pWCET: a Tool for Probabilistic Worst-Case Execution Time Analysis of Real-Time Systems
Guillem Bernat,Antoine Colin,Stefan M. Petters +2 more
- 01 Jan 2003
TL;DR: The tool support for a framework for performing probabilistic worst-case execution time (WCET) analysis for embedded real-time systems is described and the theoretical framework and the components of the tool are illustrated together with a case study.
130
•Journal Article
Integrating path and timing analysis using instruction-level simulation techniques
Thomas Lundqvist,Per Stenström +1 more
TL;DR: In this article, the authors present a new method that integrates path and timing analysis to estimate worst-case execution time on contemporary processors with complex pipelines and multi-level memory hierarchies.
78
Realism in Statistical Analysis of Worst Case Execution Times
David Griffin,Alan Burns +1 more
- 01 Jan 2010
TL;DR: To ensure that predictions made by EVT estimations are safe, additional restrictions on their use are proposed and justified.
68
References
Limiting forms of the frequency distribution of the largest or smallest member of a sample
R. A. Fisher,L. H. C. Tippett +1 more
- 01 Apr 1928
TL;DR: In this article, the problem of finding the appropriate limiting distribution in any case may be found from the manner in which the probability of exceeding any value x tends to zero as x is increased.
Priority inheritance protocols: an approach to real-time synchronization
TL;DR: An investigation is conducted of two protocols belonging to the priority inheritance protocols class; the two are called the basic priority inheritance protocol and the priority ceiling protocol, both of which solve the uncontrolled priority inversion problem.
2.5K
•Book
Real-Time Systems: Design Principles for Distributed Embedded Applications
Hermann Kopetz
- 22 Apr 2011
TL;DR: Real-Time Systems offers a splendid example for the balanced, integrated treatment of systems and software engineering, helping readers tackle the hardest problems of advanced real-time system design, such as determinism, compositionality, timing and fault management.
2.3K
•Book
Error Control Systems for Digital Communication and Storage
Stephen B. Wicker
- 01 Feb 1995
TL;DR: This work has shown that polynomials over Galois Fields, particularly the Hadamard, Quadratic Residue, and Golay Codes, are good candidates for Error Control Coding for Digital Communication Systems.
2.1K
Performance Analysis of Embedded Software Using Implicit Path Enumeration
Yau-Tsun Steven Li,Sharad Malik +1 more
- 01 Jan 1995
TL;DR: A solution for this problem is presented, which considers all paths implicitly by using integer linear programming, which is implemented in the program cinderella which currently targets a popular embedded processor - the Intel i960.
Related Papers (5)
Guillem Bernat,Antoine Colin,Stefan M. Petters +2 more
- 03 Dec 2002
Thomas Lundqvist,Per Stenström +1 more
- 01 Dec 1999
Jean-François Deverge,Isabelle Puaut +1 more
- 01 Jan 2007