Hardware acceleration for programs in SSA form

Authors:
Manuel Mohr;Artjom Grudnitsky;Tobias Modschiedler;Lars Bauer;Sebastian Hack;Jörg Henkel
Affiliations:
Karlsruhe Institute of Technology;Karlsruhe Institute of Technology;Karlsruhe Institute of Technology;Karlsruhe Institute of Technology;Saarland University;Karlsruhe Institute of Technology
Venue:
Proceedings of the 2013 International Conference on Compilers, Architectures and Synthesis for Embedded Systems
Year:
2013

Citing 22
Cited 0

The SPARC architecture manual: version 8

The SPARC architecture manual: version 8
Improvements to graph coloring register allocation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Are multiport memories physically feasible?

ACM SIGARCH Computer Architecture News - Special issue on input/output in parallel computer systems
SPEC CPU2000: Measuring CPU Performance in the New Millennium

Computer
The Design Space of Register Renaming Techniques

IEEE Micro
Register allocation & spilling via graph coloring

SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
Optimistic register coalescing

ACM Transactions on Programming Languages and Systems (TOPLAS)
MinneSPEC: A New SPEC Benchmark Workload for Simulation-Based Computer Architecture Research

IEEE Computer Architecture Letters
QEMU, a fast and portable dynamic translator

ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
On the Complexity of Register Coalescing

Proceedings of the International Symposium on Code Generation and Optimization
The java hotspotTM server compiler

JVM'01 Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1
Tilting at Windmills with Coq: Formal Verification of a Compilation Algorithm for Parallel Moves

Journal of Automated Reasoning
Copy coalescing by graph recoloring

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Advanced conservative and optimistic register coalescing

CASES '08 Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems
Register allocation: what does the NP-completeness proof of Chaitin et al. really prove? or revisiting register allocation: why and how

LCPC'06 Proceedings of the 19th international conference on Languages and compilers for parallel computing
A fast cutting-plane algorithm for optimal coalescing

CC'07 Proceedings of the 16th international conference on Compiler construction
Parallel copy motion

Proceedings of the 13th International Workshop on Software & Compilers for Embedded Systems
Graph-coloring and treescan register allocation using repairing

CASES '11 Proceedings of the 14th international conference on Compilers, architectures and synthesis for embedded systems
Register allocation via coloring of chordal graphs

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Preference-Guided register assignment

CC'10/ETAPS'10 Proceedings of the 19th joint European conference on Theory and Practice of Software, international conference on Compiler Construction
Register allocation for programs in SSA-Form

CC'06 Proceedings of the 15th international conference on Compiler Construction
Optimal register sharing for high-level synthesis of SSA form programs

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Register allocation is one of the most time-consuming parts of the compilation process. Depending on the quality of the register allocation, a large amount of shuffle code to move values between registers is generated. In this paper, we propose a processor architecture extension to provide register file permutations by which the shuffle code can be implemented more efficiently. We present compiler support to utilize this extension, an evaluation regarding performance and compilation time using the SPEC CINT2000 benchmark, as well as an analysis of area and frequency overhead of our architecture implementation. We find that using our extension, the number of executed instructions is reduced by up to 5.1% while the compilation time is unaffected.