Register Allocation: What Does the NP-Completeness Proof of Chaitin et al. Really Prove? Or Revisiting Register Allocation: Why and How

@inproceedings{Bouchez2006RegisterAW,
  title={Register Allocation: What Does the NP-Completeness Proof of Chaitin et al. Really Prove? Or Revisiting Register Allocation: Why and How},
  author={Florent Bouchez and Alain Darte and Christophe Guillon and Fabrice Rastello},
  booktitle={LCPC},
  year={2006}
}
Register allocation is one of the most studied problems in compilation. It is considered as an NP-complete problem since Chaitin et al., in 1981, modeled the problem of assigning temporary variables to k machine registers as the problem of coloring, with k colors, the interference graph associated to the variables. The fact that the interference graph can be arbitrary proves the NP-completeness of this formulation. However, this original proof does not really show where the complexity of… CONTINUE READING
Highly Cited
This paper has 60 citations. REVIEW CITATIONS

6 Figures & Tables

Topics

Statistics

01020'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

61 Citations

Semantic Scholar estimates that this publication has 61 citations based on the available data.

See our FAQ for additional information.