Optimal register allocation for SSA-form programs in polynomial time

DOI10.1016/J.IPL.2006.01.008zbMATH Open1187.68336OpenAlexW2151972839MaRDI QIDQ844183FDOQ844183

Authors: Sebastian Hack, Gerhard Goos 

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

graph algorithmscombinatorial problems

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

Cited In (6)

• Aliased Register Allocation for Straight-Line Programs Is NP-Complete
• Elimination of parallel copies using code motion on data dependence graphs
• Optimal shuffle code with permutation instructions
• 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

This page was built for publication: Optimal register allocation for SSA-form programs in polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844183)