Chatin's graph coloring algorithm as a method for assigning positions to Diana attributes

Authors:
Arol Ambler;Robert Trawick
Affiliations:
Data General Corporation, Research Triangle Park, NC;Data General Corporation, Research Triangle Park, NC
Venue:
ACM SIGPLAN Notices
Year:
1983

Citing 1
Cited 1

Register allocation & spilling via graph coloring

SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction

Mapping the Interface Description Language Type Model into C

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Diana, the widely used abstraction for Ada compilers' intermediate representation of Ada programs, consists of graphs of attributed nodes. A graph-coloring algorithm allocates positions for attributes within nodes of the graph, making a space and time-efficient implementation.