Practical challenges of ILP-based SPM allocation optimizations

Publikationstyp
Conference Paper
Date Issued
2016-05-23
Sprache
English
Author(s)
Oehlert, Dominic Paul  
Luppold, Arno  orcid-logo
Falk, Heiko  orcid-logo
Institut
Eingebettete Systeme E-13  
TORE-URI
http://hdl.handle.net/11420/6250
Start Page
86
End Page
89
Citation
International Workshop on Software and Compilers for Embedded Systems, SCOPES: 86-89 (2016-05-23)
Contribution to Conference
19th International Workshop on Software and Compilers for Embedded Systems, SCOPES 2016  
Publisher DOI
10.1145/2906363.2906371
Scopus ID
2-s2.0-84974569573
Scratchpad Memory (SPM) allocation is a well-known technique for compiler-based code optimizations. Integer-Linear Programming has been proven to be a powerful technique to determine which parts of a program should be moved to the SPM. Although the idea is quite straight-forward in theory, the technique features several challenges when being applied to modern embedded systems. In this paper, we aim to bring out the main issues and possible solutions which arise when trying to apply those optimizations to existing hardware platforms.
Subjects
Compiler
Integer-linear programming
Optimization
Real-time
WCET