scientific article; zbMATH DE number 910892
From MaRDI portal
zbMATH Open0849.68040MaRDI QIDQ4886067FDOQ4886067
Authors: Sampath Kannan, Todd A. Proebsting 
Publication date: 11 November 1996
Title of this publication is not available (Why is that?)
Recommendations
General topics in the theory of software (68N01) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cited In (23)
- Aliased register allocation for straight-line programs is NP-complete
- Register Allocation for Unary–Binary Trees
- The complexity of register allocation
- Title not available (Why is that?)
- Register allocation: A program-algebraic approach
- Foundations of Software Science and Computation Structures
- Iterative-free program analysis
- A hybrid evolutionary algorithm for graph coloring register allocation
- Program structure as basis for the parallelization of global register allocation
- Jump Minimization in Linear Time
- Elimination of parallel copies using code motion on data dependence graphs
- Using graph coloring in an algebraic compiler
- Languages and Compilers for Parallel Computing
- Title not available (Why is that?)
- Programming Languages and Systems
- On Local Register Allocation
- The tree-width of C
- Code scheduling with delayed register allocation
- All structured programs have small tree width and good register allocation
- Optimal shuffle code with permutation instructions
- \(k\) versus \(k+1\) index registers and modifiable versus non-modifiable programs
- Register saturation in instruction level parallelism
- Approximate triclique coloring for register allocation
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)
