(Enter summary)
Abstract: ................................................................................................................... ix
CHAPTER 1 - REGISTER ALLOCATION ...................................................................... 1
DISCUSSION OF PROBLEM ................................................................................................. 1
TERMINOLOGY.................................................................................................................. 1
STRUCTURE OF THESIS... (Update)
Active bibliography (related documents): More All
0.5: Structured Labels and Directed Paths - Nambiar School Of
(Correct)
0.1: Register Allocation via Graph Coloring - Briggs (1992)
(Correct)
0.1: Improvements to Graph Coloring Register Allocation - Briggs, Cooper, Torczon (1994)
(Correct)
Similar documents based on text: More All
0.3: A Period Graph Throughput Estimator for Multiprocessor Systems - Bambha, Bhattacharyya
(Correct)
0.1: An Analysis of Bitstate Hashing - Holzmann (1995)
(Correct)
0.1: The Situated Behavior of MUD Back Channels - Cherny
(Correct)
BibTeX entry: (Update)
@techreport{ thompson96local,
author = "Lynn Thompson",
title = "Local Register Allocation Spanning Basic Blocks",
number = "CSE-96-TH-002",
month = "1,",
year = "1996",
url = "citeseer.ist.psu.edu/thompson96local.html" }
Citations (may not include all citations):
488
Algorithmic Graph Theory and Perfect Graphs (context) - Golumbic - 1980
209
Computer Science Press (context) - Shimon - 1979
201
Register Allocation via Coloring (context) - Chaitin - 1981
164
The Superblock: An Effective Technique for VLIW and Supersca.. (context) - Hwu - 1993
159
and Tools (context) - Aho, Sethi et al. - 1986
108
Coloring Heuristics for Register Allocation (context) - Briggs - 1989
75
Register Allocation via Hierarchical Graph Coloring (context) - Callahan, Koblenz - 1991
69
Register Allocation by Priority-Based Coloring (context) - Chow, Hennessey - 1984
56
Spill Code Minimization Techniques for Optimizing Compilers (context) - Bernstein - 1989
43
A Register Allocation Framework Based on Hierarchical Cyclic..
- Hendren, Gao et al. - 1993
24
Register Allocation Via Clique Separators (context) - Gupta, Soffa et al. - 1989
24
Efficient Algorithms for Interval Graphs and Circular-Arc Gr.. (context) - Gupta, Lee et al. - 1982
12
Graph Coloring Register Allocation for Processors with Multi.. (context) - Nickerson - 1990
8
Register Allocation & Spilling Via Graph Coloring (context) - Chaitin - 1982
8
Interval Graphs and Related Topics (context) - Golumbic - 1985
2
Prentice-Hall of India (context) - Deo - 1987
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/cse.ogi.edu.html): More
A Meta-theory for Structured Presentations in the COC - Shulman (1997)
(Correct)
Learning in Compositional Hierarchies: Inducing the Structure of.. - Utans (1994)
(Correct)
When-clauses, Adverbs of quantification, and Focus - Johnston
(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