DETERMINISTIC UPPER BOUNDS OF THE WORST-CASE EXECUTION TIMES OF CACHED PROGRAMS
Conference Paper
Overview
Research
Identity
Additional Document Info
Other
View All
Overview
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. 1994 IEEE.