Deterministic upperbounds of the worst-case execution times of cached programs
- 1 January 1994
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 182-191
- https://doi.org/10.1109/real.1994.342717
Abstract
Proposes techniques to derive the worst-case execution time (WCET) of cached programs. We focus on the analysis of one single program run on a direct-mapped cache, where no external interference could occur. The analysis complexity of the WCET of (un)cached programs is NP-complete. For nested loops, we derive some sufficient conditions in deriving the deterministic bounds of their WCET. These sufficient conditions can be used to make trade-offs between tightness of the WCET bounds and their search time.Keywords
This publication has 28 references indexed in Scilit:
- SMART (strategic memory allocation for real-time) cache designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A retargetable technique for predicting execution timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Program representation and translation for predictable real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Predicting program execution times by analyzing static and dynamic program pathsReal-Time Systems, 1993
- Experiments with a program timing tool based on source-level timing schemaComputer, 1991
- Allocating Smart Cache Segments for SchedulabilityPublished by Springer Nature ,1991
- SMART (strategic memory allocation for real-time) cache design using the MIPS R3000Published by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Calculating the maximum execution time of real-time programsReal-Time Systems, 1989
- Reasoning about time in higher-level language softwareIEEE Transactions on Software Engineering, 1989
- Real-Time Behavior of ProgramsIEEE Transactions on Software Engineering, 1981