[176872] |
Title: Practical Challenges of ILP-based SPM Allocation Optimizations. <em>In Proceedings of the 19th International Workshop on Software & Compilers for Embedded Systems (SCOPES)</em> |
Written by: Dominic Oehlert, Arno Luppold and Heiko Falk |
in: May (2016). |
Volume: Number: |
on pages: 86-89 |
Chapter: |
Editor: |
Publisher: |
Series: 20160524-scopes-oehlert.pdf |
Address: St. Goar / Germany |
Edition: |
ISBN: 10.1145/2906363.2906371 |
how published: 16-70 OLK16 SCOPES |
Organization: |
School: |
Institution: |
Type: |
DOI: |
URL: |
ARXIVID: |
PMID: |
Note: doehlert, aluppold, hfalk, ESD, emp2, tacle, WCC
Abstract: 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.