Optimal register allocation for SSA-form programs in polynomial time

Authors:
Sebastian Hack;Gerhard Goos
Affiliations:
Institut für Programmstrukturen und Datenorganisation, Adenauerring 20a, 76131 Karlsruhe, Germany;Institut für Programmstrukturen und Datenorganisation, Adenauerring 20a, 76131 Karlsruhe, Germany
Venue:
Information Processing Letters
Year:
2006

Citing 7
Cited 8

An efficient method of computing static single assignment form

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A fast algorithm for finding dominators in a flowgraph

ACM Transactions on Programming Languages and Systems (TOPLAS)
Fast copy coalescing and live-range identification

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Hacker's Delight

Hacker's Delight
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Register allocation by optimal graph coloring

CC'03 Proceedings of the 12th international conference on Compiler construction
Register allocation via coloring

Computer Languages

Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Linear scan register allocation on SSA form

Proceedings of the 8th annual IEEE/ACM international symposium on Code generation and optimization
An optimal linear-time algorithm for interprocedural register allocation in high level synthesis using SSA form

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Studying optimal spilling in the light of SSA

CASES '11 Proceedings of the 14th international conference on Compilers, architectures and synthesis for embedded systems
Register allocation via graph coloring using an evolutionary algorithm

SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part II
Divergence analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
A decoupled non-SSA global register allocation using bipartite liveness graphs

ACM Transactions on Architecture and Code Optimization (TACO)
Singe: leveraging warp specialization for high performance on GPUs

Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper gives a constructive proof that the register allocation problem for a uniform register set is solvable in polynomial time for SSA-form programs.