ACM Home Page
Please provide us with feedback. Feedback
Reducing code size through address register assignment
Full text PdfPdf (943 KB)
Source ACM Transactions on Embedded Computing Systems (TECS) archive
Volume 5 ,  Issue 1  (February 2006) table of contents
Pages: 225 - 258  
Year of Publication: 2006
ISSN:1539-9087
Authors
G. Chen  Pennsylvania State University, Univerity Park, PA
M. Kandemir  Pennsylvania State University, Univerity Park, PA
M. J. Irwin  Pennsylvania State University, Univerity Park, PA
J. Ramanujam  Louisiana State University, Baton Rouge, LA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 52,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1132357.1132365
What is a DOI?

ABSTRACT

In DSP processors, minimizing the amount of address calculations is critical for reducing code size and improving performance, since studies of programs have shown that instructions that manipulate address registers constitute a significant portion of the overall instruction count (up to 55%). This work presents a compiler-based optimization strategy to “reduce the code size in embedded systems.” Our strategy maximizes the use of indirect addressing modes with postincrement/decrement capabilities available in DSP processors. These modes can be exploited by ensuring that successive references to variables access consecutive memory locations. To achieve this spatial locality, our approach uses both access pattern modification (program code restructuring) and memory storage reordering (data layout restructuring). Experimental results on a set of benchmark codes show the effectiveness of our solution and indicate that our approach outperforms the previous approaches to the problem. In addition to resulting in significant reductions in instruction memory (storage) requirements, the proposed technique improves execution time.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
5
6
7
8
 
9
 
10
 
11
12
 
13
14
15
 
16
 
17

Collaborative Colleagues:
G. Chen: colleagues
M. Kandemir: colleagues
M. J. Irwin: colleagues
J. Ramanujam: colleagues