Register Allocation via Coloring¶
Chaitin, G. J., Auslander, M. A., Chandra, A. K., Cocke, J., Hopkins, M. E., & Markstein, P. W. (1981). Register Allocation via Coloring. Computer Languages, 6(1), 47-57.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Embeddability
- In engineering, VLSI and PCB design route a circuit on a fixed number of layers without wire crossings (substrate = netlist, ambient = fixed-layer board, conflict = within-layer crossing), and compiler register allocation embeds a program's live ranges into a fixed register count without two simultaneously-live variables sharing a register — formalised as \(k\)-colourability of the interference graph.
This sourceFormalizes register allocation as k-colorability of the interference graph and introduces spilling as the remediation when the chromatic number exceeds the register count.
- In engineering, VLSI and PCB design route a circuit on a fixed number of layers without wire crossings (substrate = netlist, ambient = fixed-layer board, conflict = within-layer crossing), and compiler register allocation embeds a program's live ranges into a fixed register count without two simultaneously-live variables sharing a register — formalised as \(k\)-colourability of the interference graph.
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? Not recorded. The single citation of this work carries no recorded support check.
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:f54d11e1f143 · see in the full table