Storage optimization through offset assignment with variable coalescing
Document Type
Conference Proceeding
Publication Date
6-1-2012
Abstract
Most modern digital signal processors (DSPs) provide multiple address registers and a dedicated address generation unit (AGU) which performs address generation in parallel to instruction execution. There is no address computation overhead if the next address is within the auto-modify range. A careful placement of variables in memory is utilized to decrease the number of address arithmetic instructions and thus to generate compact and efficient code. The simple offset assignment (SOA) problem concerns the layout of variables for machines with one address register and the general offset assignment (GOA) deals with multiple address registers. Both these problems assume that each variable needs to be allocated for the entire duration of a program. Both SOA and GOA are NP-complete. In this article, we present effective heuristics for the simple and the general offset assignment problems with variable coalescing where two or more noninterfering variables can be mapped into the same memory location. Results on several benchmarks show the significant improvement of our proposed heuristics compared to other heuristics in the literature © 2012 ACM.
Publication Source (Journal or Book title)
Transactions on Embedded Computing Systems
Recommended Citation
Salamy, H., & Ramanujam, J. (2012). Storage optimization through offset assignment with variable coalescing. Transactions on Embedded Computing Systems, 11 S (1) https://doi.org/10.1145/2180887.2180893