Deterministic upperbounds of the worst-case execution times of cached programs Conference Paper uri icon

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.

name of conference

  • Proceedings Real-Time Systems Symposium

published proceedings

  • Proceedings Real-Time Systems Symposium REAL-94

author list (cited authors)

  • Jyh-Charn Liu, .., & Hung-Ju Lee.

citation count

  • 21

publication date

  • January 1994