Name
Abstract | ||
|---|---|---|
Caching of complete methods has been suggested to simplify the determination of the worst-case execution time (WCET) in the presence of a memory hierarchy [9]. While this previous approach limits possible cache misses to method invocations and returns, it still assumes a conventional blocked organization of the cache memory. This paper proposes and evaluates a new approach organizing the cached methods within a linked list while tag matching is limited to a sliding window of at most three methods over this linked list. The main advantages of this approach are the avoidance of low block utilization by small methods through bump-pointer space allocation and a further simplification of the WCET analysis by an easy miss prediction based solely on call stack information available locally. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1145/1288940.1288970 | JTRES |
Keywords | Field | DocType |
bump-pointer space allocation,embedded java processor,bump-pointer method,low block utilization,cache memory,cached method,wcet analysis,complete method,memory hierarchy,new approach,previous approach,possible cache,sliding window,worst case execution time,java | Cache-oblivious algorithm,Cache invalidation,Cache pollution,Cache,Computer science,Parallel computing,Real-time computing,Cache algorithms,Page cache,Cache coloring,Smart Cache | Conference |
Citations | PageRank | References |
14 | 0.64 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas B. Preußer | 1 | 48 | 5.41 |
| Martin Zabel | 2 | 52 | 5.27 |
| Rainer G. Spallek | 3 | 137 | 25.30 |