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