Title :
Deterministic upperbounds of the worst-case execution times of cached programs
Author :
Liu, Jyh-Cham ; Lee, Hung-Ju
Author_Institution :
Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA
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 :
cache storage; computational complexity; real-time systems; NP-complete; analysis complexity; bound tightness; cached programs; deterministic upper bounds; direct-mapped cache; hard real-time systems; nested loops; search time; sufficient conditions; worst-case execution time; Cache memories; Complexity theory; Real time systems;
Conference_Titel :
Real-Time Systems Symposium, 1994., Proceedings.
Conference_Location :
San Juan
Print_ISBN :
0-8186-6600-5
DOI :
10.1109/REAL.1994.342717
