ACM Home Page
Please provide us with feedback. Feedback
Optimistic coalescing for heterogeneous register architectures
Full text PdfPdf (656 KB)
Source
Language, Compiler and Tool Support for Embedded Systems archive
Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems table of contents
San Diego, California, USA
SESSION: Register and memory management table of contents
Pages: 93 - 102  
Year of Publication: 2007
ISBN:978-1-59593-632-5
Also published in ...
Authors
Minwook Ahn  Seoul National University, Seoul, South Korea
Jooyeon Lee  Seoul National University, Seoul, South Korea
Yunheung Paek  Seoul National University, Seoul, South Korea
Sponsors
ACM: Association for Computing Machinery
SIGBED: ACM Special Interest Group on Embedded Systems
SIGARCH: ACM Special Interest Group on Computer Architecture
SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 47,   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/1254766.1254781
What is a DOI?

ABSTRACT

In this paper, Optimistic coalescing has been proven as an elegant and effective technique that provides better chances of safely coloring more registers in register allocation than other coalescing techniques. Its algorithm originally assumes homogeneous registers which are all gathered in the same register file. Although this register architecture is still common in most general-purpose processors, embedded processors often contain heterogeneous registers which are scattered in physically different register files dedicated for each dissimilar purpose and use. In this work, we developed a modified algorithm for optimal coalescing that helps a register allocator for an embedded processor to better handle such heterogeneity of the register architecture. In the experiment, an existing register allocator was able to achieve up to 10% reduction in code size through our coalescing, and avoid many spills that would have been generated without our scheme.


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
Minwook Ahn, et. al., A Code Generation Approach for Heterogeneous Register Architectures, in the Proceedings of the 11th Annual Workshop on the Interaction between Compilers and Computer Architecture, 2007
 
10
 
11
 
12
 
13
R. Stallman, Using and Porting GNU CC, Free Software Foundation, June 1993
14
 
15
V. Zivojnovic, et. al., DSPstone: A DSP-Oriented Benchmarking Methodology, in the Proceedings of International Conference on Signal Processing Applications and Technology (ICSPAT)'94 -- Dallas, Oct. 1994.
 
16
 
17
Jenq-Kuen Lee, et. al., Copy Propagation Optimizations for VLIW DSP Processors with Distributed Register Files, in the Proceedings of the 19th International Workshop on Languages and Compilers for Parallel Computing (LCPC) 2006
18
 
19

Collaborative Colleagues:
Minwook Ahn: colleagues
Jooyeon Lee: colleagues
Yunheung Paek: colleagues