Register Allocation and Spilling via Graph Coloring.¶
Chaitin, G. J. (1982). Register Allocation and Spilling via Graph Coloring. Proceedings of the 1982 SIGPLAN Symposium on Compiler Construction, 17(6), 98-105.
Cited by¶
1 citation across 1 artifact.
Primes¶
- Graph Coloring
- In compilers it is register allocation — program variables live at the same point conflict, and physical registers are the colours, with spills occurring when the chromatic number exceeds register count.
SupportedVerified against the work's full text
Chaitin defines interference as simultaneous liveness, equates a coloring with a register allocation, and says spill code is needed when the chromatic number exceeds the 32 registers.
“two symbolic registers conflict or interfere, if they are ever live si- multaneously, more precisely, if one of them is live at a definition point of the other. Thus a 32-coloring of the interference graph corresponds to a permissible register allocation, and if the chromatic number of the graph is greater than 32, spill code is necessary.”
- In compilers it is register allocation — program variables live at the same point conflict, and physical registers are the colours, with spills occurring when the chromatic number exceeds register count.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:e764a90da549 · see in the full table