Fast copy coalescing and live-range identification

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2002, Pages 25-32

  Budimlić, Zoran ^a   Cooper, Keith D ^a   Harvey, Timothy J ^a   Kennedy, Ken ^a   Oberg, Timothy S ^a   Reeves, Steven W ^a  

^a Rice University   (United States)

Author keywords

Code generation; Copy coalescing; Interference graph; Live range identification; Register allocation

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; MATHEMATICAL MODELS; OPTIMIZATION; PROGRAM COMPILERS;

COALESCING;

COMPUTER GRAPHICS;

EID: 0036037940     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/543552.512534     Document Type: Conference Paper

References (12)

1. Practical improvements to the construction and destruction of static single assignment form
2. Register allocation and spilling via graph coloring
3. Register allocation via coloring
4. How to build an interference graph
5. Efficiently computing static single assignment form and the control dependence graph
6. Testing flow graph reducibility