scientific article; zbMATH DE number 910892

MaRDI QIDQ4886067zbMATH OpenFDO

Authors Sampath Kannan, Todd A. Proebsting

Publication date 11 November 1996

zbMATH Keywords

graph coloring problemregister allocation problemstructured programs

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Register Allocation in Structured Programs
• The complexity of register allocation
• scientific article; zbMATH DE number 1956454
• All structured programs have small tree width and good register allocation
• Programming Languages and Systems

Cited in

(30)

• Code scheduling with delayed register allocation
• k versus k+1 index registers and modifiable versus non-modifiable programs
• All structured programs have small tree width and good register allocation
• Elimination of parallel copies using code motion on data dependence graphs
• Using graph coloring in an algebraic compiler
• The tree-width of C
• The complexity of register allocation
• Register allocation: A program-algebraic approach
• Program structure as basis for the parallelization of global register allocation
• Jump Minimization in Linear Time
• A hybrid evolutionary algorithm for graph coloring register allocation
• Optimal shuffle code with permutation instructions
• Register Allocation for Unary–Binary Trees
• An approximation algorithm for the register allocation problem
• Register Allocation in Structured Programs
• scientific article; zbMATH DE number 1303599 (Why is no real title available?)
• scientific article; zbMATH DE number 1303600 (Why is no real title available?)
• scientific article; zbMATH DE number 1332645 (Why is no real title available?)
• scientific article; zbMATH DE number 549953 (Why is no real title available?)
• scientific article; zbMATH DE number 1107741 (Why is no real title available?)
• scientific article; zbMATH DE number 1956452 (Why is no real title available?)
• scientific article; zbMATH DE number 1956567 (Why is no real title available?)
• On Local Register Allocation
• Iterative-free program analysis
• Programming Languages and Systems
• Languages and Compilers for Parallel Computing
• Foundations of Software Science and Computation Structures
• Approximate triclique coloring for register allocation
• Register saturation in instruction level parallelism
• Aliased register allocation for straight-line programs is NP-complete

This page was built for publication:

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