TY - GEN
T1 - An ILP based approach to address code generation for digital signal processors
AU - Ozturk, O.
AU - Kandemir, M.
AU - Tosun, S.
PY - 2006
Y1 - 2006
N2 - One of the most important problems in resource-constrained embedded systems is limited memory space for code and data. This paper targets at DSP based architectures and proposes an ILP (integer linear programming) based approach for reducing code memory space requirements by exploiting the auto-increment and auto-decrement addressing modes provided by DSPs. Specifically, we address the problem of effective use of address registers, demonstrate how we can take advantage of additional capabilities that exists in some recent DSPs (such as modify registers), and discuss how our ILP-based solution can be used for performing tradeoffs between code memory and data memory space requirements. We also compare our approach to a previously-proposed heuristic solution. Our experimental analysis using several applications indicate that the proposed ILP-based approach is very effective in reducing both code memory demand and execution cycles, and the solution times it takes are within tolerable limits.
AB - One of the most important problems in resource-constrained embedded systems is limited memory space for code and data. This paper targets at DSP based architectures and proposes an ILP (integer linear programming) based approach for reducing code memory space requirements by exploiting the auto-increment and auto-decrement addressing modes provided by DSPs. Specifically, we address the problem of effective use of address registers, demonstrate how we can take advantage of additional capabilities that exists in some recent DSPs (such as modify registers), and discuss how our ILP-based solution can be used for performing tradeoffs between code memory and data memory space requirements. We also compare our approach to a previously-proposed heuristic solution. Our experimental analysis using several applications indicate that the proposed ILP-based approach is very effective in reducing both code memory demand and execution cycles, and the solution times it takes are within tolerable limits.
UR - http://www.scopus.com/inward/record.url?scp=33750898260&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33750898260&partnerID=8YFLogxK
U2 - 10.1145/1127908.1127919
DO - 10.1145/1127908.1127919
M3 - Conference contribution
AN - SCOPUS:33750898260
SN - 1595933476
SN - 9781595933478
T3 - Proceedings of the ACM Great Lakes Symposium on VLSI, GLSVLSI
SP - 37
EP - 42
BT - GLSVLSI'06 - Proceedings of the 2006 ACM Great Lakes Symposium on VLSI
PB - Association for Computing Machinery
T2 - GLSVLSI'06 - 2006 ACM Great Lakes Symposium on VLSI
Y2 - 30 April 2006 through 2 May 2006
ER -