Optimal static WCET-aware scratchpad allocation of program code

Caches are notorious for their unpredictability. It is difficult or even impossible to predict if a memory access will result in a definite cache hit or miss. This unpredictability is highly undesired especially when designing real-time systems where the worst-case execution time (WCET) is one of the key metrics. Scratchpad memories (SPMs) have proven to be a fully predictable alternative to caches. In contrast to caches, however, SPMs require dedicated compiler support. This paper presents an optimal static SPM allocation algorithm for program code. It minimizes WCETs by placing the most beneficial parts of a program's code in an SPM. Our results underline the effectiveness of the proposed techniques. For a total of 73 realistic benchmarks, we reduced WCETs on average by 7.4% up to 40%. Additionally, the run times of our ILP-based SPM allocator are negligible. Categories and Subject Descriptors D.3.4 [Programming Languages]: Compilers; Optimization; C.3 [Real-time and embedded s...

• Type: Conference
• Year: 2009
• Where: DAC
• Authors: Heiko Falk, Jan C. Kleinsorge
• Keywords: DAC 2009, Design Automation, ILP-based SPM Allocator, SPM Allocation Algorithm, Worst-case Execution Time