Optimal register allocation for SSA-form programs in polynomial time

DOI10.1016/J.IPL.2006.01.008MaRDI QIDQ844183zbMATH OpenOpenAlexFDO

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

combinatorial problemsgraph algorithms

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

• 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
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 1956454 (Why is no real title available?)

Cited in

(6)

• Elimination of parallel copies using code motion on data dependence graphs
• 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
• A linear first-order functional intermediate language for verified compilers
• Optimal shuffle code with permutation instructions
• Aliased Register Allocation for Straight-Line Programs Is NP-Complete

Describes a project that uses

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)