Register Allocation in Structured Programs

DOI10.1006/jagm.1998.0956zbMath0916.68024OpenAlexW4234132796MaRDI QIDQ4225863

Sampath Kannan, Todd A. Proebsting

Publication date: 17 January 1999

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1998.0956

zbMATH Keywords

register allocation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of compilers and interpreters (68N20)

Related Items (7)

Iterative coloring extension of a maximum clique ⋮ CHECKCOL: improved local search for graph coloring ⋮ Register loading via linear programming ⋮ Coloring graphs by iterated local search traversing feasible and infeasible solutions ⋮ Embedding a novel objective function in a two-phased local search for robust vertex coloring ⋮ Problem identification using program checking ⋮ Combinatorial optimization in system configuration design

This page was built for publication: Register Allocation in Structured Programs