Improvements to Graph Coloring Register Allocation

Improvements to Graph Coloring Register Allocation (1994)

Cached

Download Links

[www.cs.rice.edu]
[www.cs.rice.edu]

Other Repositories/Bibliography

DBLP

by Preston Briggs , Keith D. Cooper , Linda Torczon

Venue:	ACM Transactions on Programming Languages and Systems
Citations:	158 - 8 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Improvements to Graph Coloring Register Allocation	INFERENCE
AUTHOR NAME	Preston Briggs	SVM HeaderParse 0.1
AUTHOR AFFIL	Rice University	SVM HeaderParse 0.2
AUTHOR NAME	Keith D. Cooper	SVM HeaderParse 0.1
AUTHOR AFFIL	Rice University	SVM HeaderParse 0.2
AUTHOR NAME	Linda Torczon	SVM HeaderParse 0.1
AUTHOR AFFIL	Rice University	SVM HeaderParse 0.2
ABSTRACT	This paper describes both the techniques themselves and our experience building and using register allocators that incorporate them. It provides a detailed description of optimistic coloring and rematerialization. It presents experimental data to show the performance of several versions of the register allocator on a suite of FORTRAN programs. It discusses several insights that we discovered only after repeated implementation of these allocators. Categories and Subject Descriptors: D.3.4 [Programming Languages]: Processors---compi l ers , optimization General terms: Languages Additional Key Words and Phrases: Register allocation, code generation, graph coloring 1. INTRODUCTION The relationship between run-time performance and e#ective use of a machine's register set is well understood. In a compiler, the process of deciding which values to keep in registers at each point in the generated code is called register allocation. Value	user correction - Legacy Corrections
YEAR	1994	INFERENCE
VENUE	ACM Transactions on Programming Languages and Systems	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	428--455	INFERENCE
VOLUME	16	INFERENCE
CITATIONS	33 found	ParsCit 1.0