Copy elimination on data dependence graphs

@inproceedings{Brandner2012CopyEO,
  title={Copy elimination on data dependence graphs},
  author={F. Brandner and Quentin Colombet},
  booktitle={SAC '12},
  year={2012}
}
Register allocation recently regained much interest due to new decoupled strategies that split the problem into separate phases: spilling, register assignment, and copy elimination. A common assumption of existing copy elimination approaches is that the original ordering of the instructions in the program is not changed. This work presents an extension of a local recoloring technique called Parallel Copy Motion. We perform code motion on data dependence graphs in order to eliminate useless… Expand

References

Optimal spilling for CISC machines with few registers
  • 153
  • Highly Influential
  • PDF