Article

Optimizing Translation Out of SSA Using Renaming Constraints

Authors:

CGO '04: Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization

Page 265

Published: 20 March 2004 Publication History

Get Access

Abstract

Static Single Assignment form is an intermediate representationthat usesinstructions to merge values ateach confluent point of the control flow graph. instructionsare not machine instructions and must be renamedback to move instructions when translating out of SSAform.Without a coalescing algorithm, the out of SSAtranslation generates many move instructions.Leung andGeorge use a SSA form for programs represented as native machine instructions, including the use of machinededicated registers.For this purpose, they handlerenaming constraints thanks to a pinning mechanism.Pinningarguments and their corresponding definitionto a common resource is also a very attractive techniquefor coalescing variables.In this paper, extending thisidea, we propose a method to reduce the -related copiesduring the out of SSA translation, thanks to a pinning-basedcoalescing algorithm that is aware of renaming constraints.We implemented our algorithm in the STMicro-electronicsLinear Assembly Optimizer.Our experimentsshow interesting results when comparing to the existingapproaches of Leung and George, Sreedhar etal., and Appel and George for register coalescing.

References

[1]

{1} P. Briggs, K. D. Cooper, T. J. Harvey, and L. T. Simpson. Practical improvements to the construction and destruction of static single assignment form. Software - Practice and Experience, 28(8):859-881, July 1998.

Digital Library

Google Scholar

[2]

{2} Z. Budimlic, K. Cooper, T. Harvey, K. Kennedy, T. Oberg, and S. Reeves. Fast copy coalescing and live-range identification. In SIGPLAN International Conference on Programming Languages Design and Implementation , pages 25-32. ACM Press, June 2002.

Digital Library

Google Scholar

[3]

{3} G. J. Chaitin. Register allocation & spilling via graph coloring. In Proceedings of the 1982 SIGPLAN symposium on Compiler construction, pages 98-101, 1982.

Digital Library

Google Scholar

[4]

{4} R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451-490, 1991.

Digital Library

Google Scholar

[5]

{5} B. Dupont de Dinechin, F. de Ferrière, C. Guillon, and A. Stoutchinin. Code generator optimizations for the ST120 DSP-MCU core. In International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, pages 93-103, 2000.

Digital Library

Google Scholar

[6]

{6} European Telecommunications Standards Institute (ETSI). GSM technical activity, SMG11 (speech) working group. Available at http://www.etsi.org.

Google Scholar

[7]

{7} L. George and A. W. Appel. Iterated register coalescing. ACM Transactions on Programming Languages and Systems, 18(3), May 1996.

Digital Library

Google Scholar

[8]

{8} A. L. Leungand L. George. Staticsingle assignment form for machine code. In SIGPLAN International Conference on Programming Languages Design and Implementation , pages 204-214, 1999.

Digital Library

Google Scholar

[9]

{9} J. Park and S.-M. Moon. Optimistic register coalescing. In IEEE International Conference on Parallel Architectures and Compilation Techniques, pages 196-204, 1998.

Digital Library

Google Scholar

[10]

{10} F. Rastello, F. de Ferrière, and C. Guillon. Optimizing the translation out-of-SSA with renaming constraints. Technical Report RR2003-35, LIP, ENS-Lyon, France, June 2003. Available at http://www.ens-lyon.fr/ LIP/.

Google Scholar

[11]

{11} V. Sreedhar, R. Ju, D. Gillies, and V. Santhanam. Translating out of static single assignment form. In Static Analysis Symposium, Italy, pages 194-204, 1999.

Digital Library

Google Scholar

[12]

{12} Standard Performance Evaluation Corporation (SPEC). SPEC CINT2000 benchmarks. Available at http://www.spec.org/cpu2000/CINT2000/.

Google Scholar

[13]

{13} A. Stoutchinin and F. de Ferrière. Efficient static single assignment form for predication. In 34th annual ACM/IEEE international symposium on Microarchitecture , pages 172-181. IEEE Computer Society, 2001.

Digital Library

Google Scholar

Cited By

View all

Curtis CGrissom DBrisk PKnoop JSchordan MJohnson TO'Boyle M(2018)A compiler for cyber-physical digital microfluidic biochipsProceedings of the 2018 International Symposium on Code Generation and Optimization10.1145/3168826(365-377)Online publication date: 24-Feb-2018
https://dl.acm.org/doi/10.1145/3168826
Boissinot BDarte ARastello Fde Dinechin BGuillon C(2009)Revisiting Out-of-SSA Translation for Correctness, Code Quality and EfficiencyProceedings of the 7th annual IEEE/ACM International Symposium on Code Generation and Optimization10.1109/CGO.2009.19(114-125)Online publication date: 22-Mar-2009
https://dl.acm.org/doi/10.1109/CGO.2009.19
Sassa MIto YKohama M(2009)Comparison and evaluation of back-translation algorithms for static single assignment formsComputer Languages, Systems and Structures10.1016/j.cl.2007.03.00135:2(173-195)Online publication date: 1-Jul-2009
https://dl.acm.org/doi/10.1016/j.cl.2007.03.001
Show More Cited By

Index Terms

Optimizing Translation Out of SSA Using Renaming Constraints
1. Hardware
  1. Electronic design automation
    1. Logic synthesis
      1. Circuit optimization
  2. Emerging technologies
    1. Analysis and design of emerging devices and systems
      1. Emerging languages and compilers
2. Software and its engineering
  1. Software notations and tools
    1. Compilers

Recommendations

Virtual register renaming
ARCS'13: Proceedings of the 26th international conference on Architecture of Computing Systems

This paper presents a novel high performance substrate for building energy-efficient out-of-order superscalar cores. The architecture does not require a reorder buffer or physical registers for register renaming and instruction retirement. Instead, it ...
Virtual register renaming: energy efficient substrate for continual flow pipelines
GLSVLSI '13: Proceedings of the 23rd ACM international conference on Great lakes symposium on VLSI

Continual Flow Pipelines (CFP) allow a processor core to process instruction windows of hundreds of in-flight instructions while keeping its cycle critical scheduler and register file small. CFP defers the execution of instructions that depend on cache ...
Tuning the continual flow pipeline architecture with virtual register renaming

Continual Flow Pipelines (CFPs) allow a processor core to process hundreds of in-flight instructions without increasing cycle-critical pipeline resources. When a load misses the data cache, CFP checkpoints the processor register state and then moves all ...

Comments

Information & Contributors

Information

Published In

CGO '04: Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization

March 2004

301 pages

ISBN:0769521029

Publisher

IEEE Computer Society

United States

Publication History

Published: 20 March 2004

Check for updates

Qualifiers

Article

Conference

CGO04

Sponsor:

CGO04: Second Annual IEEE / ACM International Symposium on Code Generation and Optimization

March 20 - 24, 2004

California, Palo Alto

Acceptance Rates

CGO '04 Paper Acceptance Rate 25 of 79 submissions, 32%;

Overall Acceptance Rate 312 of 1,061 submissions, 29%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
419
Total Downloads

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

Reflects downloads up to 03 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Curtis CGrissom DBrisk PKnoop JSchordan MJohnson TO'Boyle M(2018)A compiler for cyber-physical digital microfluidic biochipsProceedings of the 2018 International Symposium on Code Generation and Optimization10.1145/3168826(365-377)Online publication date: 24-Feb-2018
https://dl.acm.org/doi/10.1145/3168826
Boissinot BDarte ARastello Fde Dinechin BGuillon C(2009)Revisiting Out-of-SSA Translation for Correctness, Code Quality and EfficiencyProceedings of the 7th annual IEEE/ACM International Symposium on Code Generation and Optimization10.1109/CGO.2009.19(114-125)Online publication date: 22-Mar-2009
https://dl.acm.org/doi/10.1109/CGO.2009.19
Sassa MIto YKohama M(2009)Comparison and evaluation of back-translation algorithms for static single assignment formsComputer Languages, Systems and Structures10.1016/j.cl.2007.03.00135:2(173-195)Online publication date: 1-Jul-2009
https://dl.acm.org/doi/10.1016/j.cl.2007.03.001
Bouchez FDarte ARastello FAltman E(2008)Advanced conservative and optimistic register coalescingProceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems10.1145/1450095.1450119(147-156)Online publication date: 19-Oct-2008
https://dl.acm.org/doi/10.1145/1450095.1450119
Brisk PVerma AIenne PKim TSainrat PLumetta SNavarro N(2007)An optimistic and conservative register assignment heuristic for chordal graphsProceedings of the 2007 international conference on Compilers, architecture, and synthesis for embedded systems10.1145/1289881.1289919(209-217)Online publication date: 30-Sep-2007
https://dl.acm.org/doi/10.1145/1289881.1289919
Brisk PSarrafzadeh M(2007)Interference graphs for procedures in static single information form are interval graphsProceedingsof the 10th international workshop on Software & compilers for embedded systems10.1145/1269843.1269858(101-110)Online publication date: 20-Apr-2007
https://dl.acm.org/doi/10.1145/1269843.1269858
Bouchez FDarte ARastello F(2007)On the Complexity of Register CoalescingProceedings of the International Symposium on Code Generation and Optimization10.1109/CGO.2007.26(102-114)Online publication date: 11-Mar-2007
https://dl.acm.org/doi/10.1109/CGO.2007.26
Bouchez FDarte AGuillon CRastello F(2006)Register allocationProceedings of the 19th international conference on Languages and compilers for parallel computing10.5555/1757112.1757141(283-298)Online publication date: 2-Nov-2006
https://dl.acm.org/doi/10.5555/1757112.1757141

View Options

Get Access

Login options

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

Cited By

Index Terms

Recommendations

Virtual register renaming

Virtual register renaming: energy efficient substrate for continual flow pipelines

Tuning the continual flow pipeline architecture with virtual register renaming

Comments

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Virtual register renaming

Virtual register renaming: energy efficient substrate for continual flow pipelines

Tuning the continual flow pipeline architecture with virtual register renaming

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations