• DOI:10.1145/378795.378854
Corpus ID: 1380545

Optimal spilling for CISC machines with few registers

@inproceedings{Appel2001OptimalSF,
  title={Optimal spilling for CISC machines with few registers},
  author={Andrew W. Appel and L. George},
  booktitle={PLDI '01},
  year={2001}
}

Andrew W. Appel, L. George

Published in PLDI '01 2001

Computer Science

Many graph-coloring register-allocation algorithms don't work well for machines with few registers. Heuristics for live-range splitting are complex or suboptimal; heuristics for register assignment rarely factor the presence of fancy addressing modes; these problems are more severe the fewer registers there are to work with. We show how to optimally split live ranges and optimally use addressing modes, where the optimality condition measures dynamically weighted loads and stores but not… CONTINUE READING

View on ACM

cs.ucla.edu

Save to Library

Create Alert

Cite

Launch Research Feed