Program Structure as Basis for the Parallelization of Global Register Allocation

No abstract is available for this paper.

• Publication year

  1993

• Venue

  Computer languages

• Publication date

  1993-04-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1016/0096-0551(93)90007-N
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Program structure as a basis for the parallelization of global compiler optimizations

  1992cited by this paper
• Register allocation using cyclic interval graphs: a new approach to an old problem

  1992cited by this paper
• Register allocation via hierarchical graph coloring

  1991cited by this paper
• Phase Ordering of Register Allocation and Instruction Scheduling

  1991cited by this paper
• Building blocks for a new generation of application specific computing systems

  1990cited by this paper
• The priority-based coloring approach to register allocation

  1990cited by this paper
• Spill code minimization techniques for optimizing compliers

  1989cited by this paper
• Register allocation via clique separators

  1989cited by this paper
• Numerical Recipes in C: The Art of Scientific Computing

  1989cited by this paper
• Warp experience: we can map computations onto a parallel computer efficiently

  1988cited by this paper
• Register allocation in the SPUR Lisp compiler

  1986cited by this paper
• Decomposition by clique separators

  1985cited by this paper
• An overview of the PL.8 compiler

  1982cited by this paper
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

  1972cited by this paper

• Languages

  2000cites this paper
• The Graph Coloring Problem: A Bibliographic Survey

  1998cites this paper