Practical Challenges of ILP-based SPM Allocation Optimizations

Practical Challenges of ILP-based SPM Allocation Optimizations
复制标题

DOI：
10.1145/2906363.2906371
复制
发表时间：
2016-05
期刊：
Proceedings of the 19th International Workshop on Software and Compilers for Embedded Systems
影响因子：
--
通讯作者：
Dominic Oehlert;Arno Luppold;H. Falk
Dominic Oehlert;Arno Luppold;H. Falk
中科院分区：
其他
文献类型：
--
作者：
Dominic Oehlert;Arno Luppold;H. Falk

文献摘要

被引文献

相似文献

ScratchPad内存(SPM)分配是一种众所周知的基于编译器的代码优化技术。整数-线性规划已被证明是一种强大的技术，可以确定程序的哪些部分应该转移到SPM。尽管这一想法在理论上相当简单，但在应用于现代嵌入式系统时，这项技术面临着一些挑战。在本文中，我们的目标是提出在现有硬件平台上应用这些优化时出现的主要问题和可能的解决方案。
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.