More Web Proxy on the site http://driver.im/

article

A retargetable register allocation framework for embedded processors

Authors:

Jean-Marc Daveau,

Thierry Lepley,

Miguel SantanaAuthors Info & Claims

ACM SIGPLAN Notices, Volume 39, Issue 7

Pages 202 - 210

https://doi.org/10.1145/998300.997192

Published: 11 June 2004 Publication History

Abstract

This paper describes the FlexCC2 register allocation framework. FlexCC2 is an optimizing retargetable C compiler for embedded processors, and in particular for DSP processors. Embedded processors often contain features such as irregular and constrained register sets that complicate register allocation, making traditional methods inefficient. In this paper, we present a register allocation framework specifically tailored for embedded processor specificities. This framework has been integrated in the FlexCC2 production compiler and is used by FlexCC2 customers.

References

[1]

ACE Associated Compiler Expert bv. The CoSy Framework, a Compiler Construction System. Ref. CoSy-8006-fw, 2000.]]

[2]

A. Appel, J. Davidson, and N. Ramsey. The Zephyr Compiler Infrastructure. Internal Report, http://www.cs.virginia.edu/zephyr, University of Virginia, 1998.]]

[3]

P. Bergner, P. Dahl, D. Engebretsen, M. O'Keefe. Spill Code Minimization via Interference Region Spilling. Proceedings of the ACM SIGPLAN '97 Conference on Programming Language Design and Implementation, SIGPLAN Notices 32(6):287--295, June 1997.]]

Digital Library

[4]

V. Bertin et all, FlexCC2: An Optimizing Retargetable C Compiler for DSP Application. Proceeding of the Second Workshop on Embedded Software (EMSOFT'02), LNCS 2491, Pages 382--398, October 2002.]]

Digital Library

[5]

P. Briggs. Register Allocation via Graph Coloring. Ph.d Thesis, Rice University, April 1992.]]

Digital Library

[6]

P. Briggs, K.D. Cooper, L. Torczon. Coloring Register Pairs. ACM Letters on Programming Languages and Systems, 1(1):3--13, March 1992.]]

Digital Library

[7]

P. Briggs, K.D. Cooper, K. Kennedy, L. Torczon. Coloring Heuristics for Register Allocation. Proceedings of the ACM SIGPLAN '89 Conference on Programming Language Design and Implementation, SIGPLAN Notices 24(7):275--284, July 1989.]]

Digital Library

[8]

D. Callahan, B. Koblenz. Register Allocation via Hierarchical Graph Coloring. Proceedings of the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation, SIGPLAN Notices 26(6):192--202, June 1991.]]

Digital Library

[9]

G.J. Chaitin. Register Allocation and Spilling via Graph Coloring. Proceedings of the ACM SIGPLAN '82 Symposium on Compiler Construction, SIGPLAN Notices 17(6):98--105, June 1982.]]

Digital Library

[10]

K.D. Cooper, L.T. Simpson. Live Range Splitting in a Graph Coloring Register Allocator. Proceedings of the 7th International Conference on Compiler Construction, April 1998.]]

Digital Library

[11]

L. George, A. Appel. Iterated Register Coalescing. ACM Transactions on Programming Languages and Systems, 18(3):300--324, May 1996.]]

Digital Library

[12]

S. Jung, Y. Paek. The Very Portable Optimizer for Digital Signal Processors. Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems (CASES'01), November 2001, Pages 84--92.]]

Digital Library

[13]

D. Kästner. PROPAN: A Retargetable System for Postpass Optimisations and Analyses. Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers and Tools for Embedded Systems (LCTES'00), June 2000.]]

Digital Library

[14]

D. Kästner. TDL: A Hardware Description Language for Retargetable Postpass Optimizations and Analyses. Proceedings of the Second International Conference on Generative Programming and Component Engineering, LNCS 2830, Pages 18--36, September 2003.]]

Digital Library

[15]

T. Kong, K.D. Wilken. Precise Register Allocation for Irregular Architecture. Proceedings of the 31st Annual ACM/IEEE International Symposium on Microarchitecture (MICRO '98), November 1998, Pages 297--307.]]

Digital Library

[16]

G.Y. Lueh, T. Gross, A.R. Adl-Tabatabai. Fusion Based Register Allocation. ACM Transactions on Programming Languages and Systems, 22(3):431--470, May 2000.]]

Digital Library

[17]

E. Rohou, F. Bodin, A. Seznec. SALTO: System for Assembly Language Transformation and Optimization. Technical report 1032, IRISA, September 1996.]]

[18]

J. Runeson, S-O Nyström. Retargetable Graph-Coloring Register Allocation for Irregular Architectures. Proceedings of the 7th International Workshop on Software and Compilers for Embedded Systems (SCOPES'03), September 2003, Pages 240--254.]]

Cited By

Lee YChen C(2019)An effective and efficient code generation algorithm for uniform loops on non-orthogonal DSP architectureJournal of Systems and Software10.1016/j.jss.2006.06.00280:3(410-428)Online publication date: 2-Jan-2019
https://dl.acm.org/doi/10.1016/j.jss.2006.06.002
Lee YChen C(2018)An Efficient Code Generation Algorithm for Non-orthogonal DSP ArchitectureJournal of VLSI Signal Processing Systems10.1007/s11265-007-0053-x47:3(281-296)Online publication date: 26-Dec-2018
https://dl.acm.org/doi/10.1007/s11265-007-0053-x
Lintzmayer CMulati MSilva A(2012)Register Allocation by Evolutionary AlgorithmProceedings of the 2012 31st International Conference of the Chilean Computer Science Society10.1109/SCCC.2012.31(207-215)Online publication date: 12-Nov-2012
https://dl.acm.org/doi/10.1109/SCCC.2012.31
Show More Cited By

Index Terms

A retargetable register allocation framework for embedded processors
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
      1. Retargetable compilers

Recommendations

A retargetable register allocation framework for embedded processors
LCTES '04: Proceedings of the 2004 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems

This paper describes the FlexCC2 register allocation framework. FlexCC2 is an optimizing retargetable C compiler for embedded processors, and in particular for DSP processors. Embedded processors often contain features such as irregular and constrained ...
Register coalescing techniques for heterogeneous register architecture with copy sifting

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, ...
Optimistic coalescing for heterogeneous register architectures
LCTES '07: Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems

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 ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices

ACM SIGPLAN Notices Volume 39, Issue 7

LCTES '04

July 2004

265 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/998300

Issue’s Table of Contents

LCTES '04: Proceedings of the 2004 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
June 2004
276 pages
ISBN:1581138067
DOI:10.1145/997163
General Chair:
David Whalley
Florida State University
,
Program Chair:
Ron Cytron
Washington University

Copyright © 2004 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 June 2004

Published in SIGPLAN Volume 39, Issue 7

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
618
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Lee YChen C(2019)An effective and efficient code generation algorithm for uniform loops on non-orthogonal DSP architectureJournal of Systems and Software10.1016/j.jss.2006.06.00280:3(410-428)Online publication date: 2-Jan-2019
https://dl.acm.org/doi/10.1016/j.jss.2006.06.002
Lee YChen C(2018)An Efficient Code Generation Algorithm for Non-orthogonal DSP ArchitectureJournal of VLSI Signal Processing Systems10.1007/s11265-007-0053-x47:3(281-296)Online publication date: 26-Dec-2018
https://dl.acm.org/doi/10.1007/s11265-007-0053-x
Lintzmayer CMulati MSilva A(2012)Register Allocation by Evolutionary AlgorithmProceedings of the 2012 31st International Conference of the Chilean Computer Science Society10.1109/SCCC.2012.31(207-215)Online publication date: 12-Nov-2012
https://dl.acm.org/doi/10.1109/SCCC.2012.31
Xavier TOliveira GLima ESilva A(2012)A Detailed Analysis of the LLVM's Register AllocatorsProceedings of the 2012 31st International Conference of the Chilean Computer Science Society10.1109/SCCC.2012.29(190-198)Online publication date: 12-Nov-2012
https://dl.acm.org/doi/10.1109/SCCC.2012.29
Lintzmayer CMulati MSilva A(2011)Register Allocation with Graph Coloring by Ant Colony OptimizationProceedings of the 2011 30th International Conference of the Chilean Computer Science Society10.1109/SCCC.2011.32(247-255)Online publication date: 9-Nov-2011
https://dl.acm.org/doi/10.1109/SCCC.2011.32
Ahn MPaek Y(2009)Register coalescing techniques for heterogeneous register architecture with copy siftingACM Transactions on Embedded Computing Systems (TECS)10.1145/1457255.14572638:2(1-37)Online publication date: 9-Feb-2009
https://dl.acm.org/doi/10.1145/1457255.1457263
Venturini HRiss FFernandez JSantana MFalk H(2008)A fully-non-transparent approach to the code location problemProceedings of the 11th international workshop on Software & compilers for embedded systems10.1145/1361096.1361108(61-68)Online publication date: 13-Mar-2008
https://dl.acm.org/doi/10.1145/1361096.1361108
Ahn MLee JPaek Y(2007)Optimistic coalescing for heterogeneous register architecturesACM SIGPLAN Notices10.1145/1273444.125478142:7(93-102)Online publication date: 13-Jun-2007
https://dl.acm.org/doi/10.1145/1273444.1254781
Ahn MLee JPaek YPande SLi Z(2007)Optimistic coalescing for heterogeneous register architecturesProceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems10.1145/1254766.1254781(93-102)Online publication date: 13-Jun-2007
https://dl.acm.org/doi/10.1145/1254766.1254781

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents