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¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:f54d11e1f143 · see in the full table