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)
Context of citations to this paper: More
.... in which the graph coloring procedure is called iteratively [67] Further improvements of these principles have been described [68] [70]. In practice, several of the assumptions made above may not be satisfied. First of all, most practical processors have a heterogeneous...
Cited by: More
A Progressive Register Allocator for Irregular Architectures - David Koes And (Correct)
Improved Passive Splitting - Keith Cooper Jason (Correct)
Adaptive Explicitly Parallel Instruction Computing - Surendranath Talla Of (2000) (Correct)
Similar documents (at the sentence level):
7.5%: Improvements to Graph Coloring Register Allocation - Briggs, COOPER, TORCZON (1994) (Correct)
7.0%: Rematerialization - Briggs, Cooper, Torczon (1992) (Correct)
5.7%: Coloring Register Pairs - Briggs, Cooper, Torczon (1992) (Correct)
Active bibliography (related documents): More All
1.1: Register Allocation sans Coloring - Krishna, Krishnamurthy (1994) (Correct)
0.7: Using Compiler Technology to Drive Advanced Microprocessors - Cooper (1992) (Correct)
0.6: Code Optimizers and Register Organizations for Vector Architectures - Lee (1992) (Correct)
Similar documents based on text: More All
0.4: Register Allocation via Graph Coloring - Briggs (1992) (Correct)
0.3: Spill Code Minimization Techniques for Graph Coloring Register.. - Bergner (1997) (Correct)
0.2: Iterated Register Coalescing - George, Appel (1996) (Correct)
Related documents from co-citation: More All
38: Register allocation and spilling via graph coloring (context) - Chaitin - 1982
36: Register allocation via coloring (context) - Chaitin, Auslander et al. - 1981
24: Register allocation via hierarchical graph coloring (context) - Callahan, Koblenz - 1991
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
69 Register allocation by priority-based coloring (context) - Chow, Hennessy - 1984
66 The generation of optimal code for arithmetic expressions (context) - Sethi, Ullman - 1970
61 Standards Performance Evaluation Corporation (context) - release - 1990
56 Spill code minimization techniques for optimizing compilers (context) - Bernstein, Goldin et al. - 1989
53 Optimal code generation for expression trees (context) - Aho, Johnson - 1976
53 Automatic construction of sparse data flow evaluation graphs (context) - Choi, Cytron et al. - 1991
43 The impact of interprocedural analysis and optimization on t.. (context) - Cooper, Kennedy et al. - 1986
40 A Portable Machine-Independent Global Optimizer -- Design an.. (context) - Chow - 1983
36 Language: A Programming Environment for Data Analysis and Gr.. (context) - Becker, Chambers et al. - 1988
36 Algorithmic Graph Theory and Perfect Graphs (context) - Golumbic - 1980
36 Fast allocation and deallocation of memory based on object l.. (context) - Hanson - 1990
34 The complexity of near-optimal graph coloring (context) - Garey, Johnson - 1976
30 Smallest-last ordering and clustering and graph coloring alg.. (context) - Matula, Beck - 1983
29 and Linda Torczon (context) - Briggs, Cooper - 1992
24 Register allocation via clique separators (context) - Gupta, Soffa et al. - 1989
24 Code generation for expressions with common subexpressions (context) - Aho, Johnson et al. - 1977
20 Automatic storage optimization (context) - Fabri - 1979
20 Register allocation in the SPUR Lisp compiler (context) - Larus, Hilfinger - 1986
20 Automatic Storage Optimization (context) - Fabri - 1982
19 Register allocation via usage counts (context) - Freiburghouse - 1974
15 On programming: An interim report on the SETL project (context) - Schwartz - 1973
14 Experiences creating a portable Cedar (context) - Atkinson, Demers et al. - 1989
12 The value of renaming for parallelism detection and storage .. (context) - Cytron, Ferrante et al. - 1987
12 Graph coloring register allocation for processors with multi.. (context) - Nickerson - 1990
12 Testing flow graph reducibility (context) - Tarjan - 1974
11 Register allocation across procedure and module boundaries (context) - Santhanam, Odnert - 1990
9 ACM Letters on Programming Languages and Systems (context) - Briggs, Cooper et al. - 1992
6 The history of Fortran (context) - Backus - 1981
5 Register allocation at link time (context) - Wall - 1986
5 Reduction of the problem of memory allocation in programming.. (context) - Ershov - 1962
5 Compiling for the RT PC ROMP (context) - Hopkins - 1986
5 Alpha -- an automatic programming system of high efficiency (context) - Ershov - 1966
5 Personal communication (context) - Chaitin - 1992
5 Compiled instruction set simulation - Mills, Ahalt et al. - 1991
4 Auslander and Martin E (context) - Marc - 1982
4 Register Allocation in Optimizing Compilers (context) - Leverett - 1983
4 Personal communication (context) - Chow - 1991
3 Conversation during visit to Rice (context) - Hopkins - 1991
3 Global Flow Analysis and Register Allocation for Simple Code.. (context) - Kennedy - 1971
3 TM XP Microprocessor (context) - Corporation - 1991
3 Minimizing register use penalty at procedure call (context) - Chow - 1988
3 Origins of Programming: Discourses on Methodology (context) - Ershov - 1990
2 Effectiveness of a machine-level global optimizer (context) - Johnson, Miller - 1986
2 Economy and allocation of memory in the Alpha translator (context) - Ershov, Zmiyevskaya et al. - 1971
2 An improved storage management scheme for block structured l.. (context) - Murtagh - 1991
2 A practical environment for Fortran programming (context) - Carle, Cooper et al. - 1987
1 Older variations include Yershov and Ersov (context) - Forsythe, Malcolm et al. - 1977
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