Optimistic Register Coalescing

@inproceedings{Park1998OptimisticRC,
  title={Optimistic Register Coalescing},
  author={Jinpyo Park and Soo-Mook Moon},
  booktitle={IEEE PACT},
  year={1998}
}
Graph-coloring register allocators eliminate copies by coalescing the source and target node of a copy if they do not interfere in the interference graph. Co-alescing is, however, known to be harmful to the col-orability of the graph because it tends to yield a graph with nodes of higher degrees. Unlike aggressive coalesc-ing which coalesces any pair of non-interfering copy-related nodes, conservative coalescing or iterated coa-lescing perform safe coalescing that preserves the col-orability… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Improvements to Graph Coloring Register Allocation

ACM Trans. Program. Lang. Syst. • 1994
View 12 Excerpts
Highly Influenced

Ebcio glu. Parallelizing nonnumerical code with selective scheduling and software pipelin- ing

K.S.-M. Moon
ACM TOPLAS, • 1997
View 8 Excerpts
Highly Influenced

Iterated Register Coalescing

View 5 Excerpts
Highly Influenced

The Priority-Based Coloring Approach to Register Allocation

ACM Trans. Program. Lang. Syst. • 1990
View 5 Excerpts
Highly Influenced

SPARC-based VLIW testbed

S.-M. Moon, H. Chung, J. Park, S. Shim, J.-W. Ahn
IEE Proceedings, • 1998
View 2 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…