Paper Info
Title
A post-compiler approach to scratchpad mapping of code
Abstract
ScratchPad Memories (SPMs) are commonly used in embedded systems because they are more energy-efficient than caches and enable tighter application control on the memory hierarchy. Optimally mapping code and data to SPMs is, however, still a challenge. This paper proposes an optimal scratchpad mapping approach for code segments, which has the distinctive characteristic of working directly on application binaries, thus requiring no access to either the compiler or the application source code - a clear advantage for legacy or proprietary, IP-protected applications.The mapping problem is solved by means of a Dynamic Programming algorithm applied to the execution traces of the target application. The algorithm is able to find the optimal set of instructions blocks to be moved into a dedicated SPM, either minimizing energy consumption or execution times. A patching tool, which can use the output of the optimal mapper, modifies the binary of the application and moves the relevant portions of its code segments to memory locations inside of the SPM.
Year
DOI
Venue
2004
10.1145/1023833.1023869
CASES
Keywords
Field
DocType
application source code,code segment,application binary,ip-protected application,post-compiler approach,optimally mapping code,tighter application control,optimal mapper,target application,optimal scratchpad mapping approach,mapping problem,microcomputers,source code,performance,embedded system,energy efficient,dynamic programming,dynamic programming algorithm,design automation
Dynamic programming,Memory hierarchy,Source code,Computer science,Parallel computing,Scratchpad memory,Real-time computing,Compiler,Electronic design automation,Energy consumption,Binary number
Conference
ISBN
Citations 
PageRank 
1-58113-890-3
60
2.12
References 
Authors
27
5
Name
Order
Citations
PageRank
Federico Angiolini159230.83
Francesco Menichelli225515.93
Alberto Ferrero3602.12
Luca Benini4131161188.49
Mauro Olivieri538536.09