Preston Briggs  Home/Search
Context Related
| daimi.aau.dk/~hendren/preston_two.ps brics.dk/~hendren/preston_two.ps inria.fr/INRIA/Projects/...thesis.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: daimi.aau.dk/~hendren/course (more) From: brics.dk/~hendren/course (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Chaitin and his colleagues at IBM in Yorktown Heights built the first global register allocator based on graph coloring. This thesis describes a series of improvements and extensions to the Yorktown allocator. There are four primary results: Optimistic coloring Chaitin's coloring heuristic pessimistically assumes any node of high degree will not be colored and must therefore be spilled. By optimistically assuming that nodes of high degree will receive colors, I often achieve lower spill costs... (Update)
Similar documents based on text: More All
0.5: Improvements to Graph Coloring Register Allocation - Briggs, Cooper, Torczon (1994) (Correct)
0.4: Register Allocation via Graph Coloring - Briggs (1992) (Correct)
0.3: Rematerialization - Briggs, Cooper, Torczon (1992) (Correct)
BibTeX entry: (Update)
Preston Briggs. Register Allocation via Graph Coloring. PhD thesis, Rice University, Houston, Texas, April 1992. http://citeseer.ist.psu.edu/briggs92register.html More
@techreport{ briggs98register,
author = "Preston Briggs",
title = "Register Allocation via Graph Coloring",
number = "TR92-183",
month = "24,",
pages = "143",
year = "1998",
url = "citeseer.ist.psu.edu/briggs92register.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
1399 Compilers: Principles (context) - Aho, Sethi et al. - 1986
773 Reducibility among combinatorial problems (context) - Karp - 1972
415 Efficiently computing static single assignment form and the .. - Cytron, Ferrante et al. - 1991
232 Constant propagation with conditional branches (context) - Wegman, Zadeck - 1991
225 Some simplified NP-complete graph problems (context) - Garey, Johnson et al. - 1976
216 Register allocation and spilling via graph coloring (context) - Chaitin - 1982
201 Register allocation via coloring (context) - Chaitin, Auslander et al. - 1981
158 Improving register allocation for subscripted variables - Callahan, Carr et al. - 1990
112 The priority-based coloring approach to register allocation (context) - Chow, Hennessy - 1990
108 Coloring heuristics for register allocation (context) - Briggs, Cooper et al. - 1989
93 Global data flow analysis and iterative algorithms (context) - Kam, Ullman - 1976
82 Garbage collection in an uncooperative environment (context) - Boehm, Weiser - 1988
75 Register allocation via hierarchical graph coloring (context) - Callahan, Koblenz - 1991
70 Integrating register allocation and instruction scheduling f.. (context) - Bradlee, Eggers et al. - 1991
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.daimi.aau.dk/~hendren/course.html):
Combining Analyses, Combining Optimizations - Click, Jr. (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC