Register Allocation via Graph Coloring

Register Allocation via Graph Coloring (1992)

by Preston Briggs

Citations:

133 - 4 self

User correction supplied by mph

Datum	Value	Source
TITLE	Register Allocation via Graph Coloring	user correction - Legacy Corrections
AUTHOR NAME	Preston Briggs	user correction
AUTHOR AFFIL	; Computer Science; Mathematical Sciences	user correction
AUTHOR ADDR	; Houston, Texas	user correction
ABSTRACT	Chaitin and his colleagues at IBM in Yorktown Heights built the first global register allocator based on graph coloring. This thesis describes a series of improvements and extensions to the Yorktown allocator. There are four primary results: Optimistic coloring Chaitin's coloring heuristic pessimistically assumes any node of high degree will not be colored and must therefore be spilled. By optimistically assuming that nodes of high degree will receive colors, I often achieve lower spill costs and faster code; my results are never worse. Coloring pairs The pessimism of Chaitin's coloring heuristic is emphasized when trying to color register pairs. My heuristic handles pairs as a natural consequence of its optimism. Rematerialization Chaitin et al. introduced the idea of rematerialization to avoid the expense of spilling and reloading certain simple values. By propagating rematerialization information around the SSA graph using a simple variation of Wegman and Zadeck's constant propag...	user correction - Legacy Corrections
YEAR	1992	INFERENCE
VENUE TYPE	TECHREPORT	INFERENCE
TECH	PhD thesis	INFERENCE
CITATIONS	64 found	ParsCit 1.0