Optimal register allocation for SSA-form programs in polynomial time

DOI10.1016/j.ipl.2006.01.008zbMath1187.68336OpenAlexW2151972839MaRDI QIDQ844183

Gerhard Goos, Sebastian Hack

Publication date: 18 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.01.008

zbMATH Keywords

combinatorial problemsgraph algorithms

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Optimal Shuffle Code with Permutation Instructions ⋮ Elimination of parallel copies using code motion on data dependence graphs ⋮ A Linear First-Order Functional Intermediate Language for Verified Compilers ⋮ A methodology pruning the search space of six compiler transformations by addressing them together as one problem and by exploiting the hardware architecture details ⋮ A methodology for speeding up loop kernels by exploiting the software information and the memory architecture

Uses Software

• Dhrystone

Cites Work

• A fast algorithm for finding dominators in a flowgraph
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Unnamed Item
• Unnamed Item