(Enter summary)
Abstract: As the size and complexity of software continues to grow, it will be necessary
for software construction systems to collect, maintain, and utilize much more
information about programs than systems do now. This dissertation explores compiler
utilization of profile data. (Update)
Context of citations to this paper: More
...by a few orders of magnitude, rendering the technique infeasible. One obvious method for reducing this code growth is feedback. Samples [37] presents an in depth analysis of light weight, efficient methods for run time profiling. Ball and Larus [6] also discuss this problem....
...intraprocedural block reordering strategy with only minor modifications to apply it in the context of dynamic recompilation. Samples [26] explores a similar intraprocedural algorithm that reduces instruction cache miss rates by up to 50 . Pettis and Hansen [24] also describe an...
Cited by: More
A Transparent Method for Correlating Profiles with Source.. - Eugene Albert Gem (1999)
(Correct)
Selecting Better-Performing Alternative Code Using Run-Time.. - Ping-Shun Huang (1995)
(Correct)
An Infrastructure for Profile-Driven Dynamic Recompilation - Burger, Dybvig (1998)
(Correct)
Active bibliography (related documents): More All
1.0: SETL for Internet Data Processing - Bacon (2000)
(Correct)
0.5: Cache Coherence Protocols for Large-Scale Multiprocessors - Chaiken (1990)
(Correct)
0.5: Object-Oriented Programming in Scheme with First-Class.. - Banavar, Lindstrom (1995)
(Correct)
Similar documents based on text:
0.0: Unknown -
(Correct)
Related documents from co-citation: More All
2: Profile guided code positioning (context) - Pettis, Hansen - 1990
2: Using profile information to assist classic compiler code optimizations
- Chang, Mahlke et al. - 1991
2: Alpha Architecture Reference Manual (context) - Sites - 1992
BibTeX entry: (Update)
Alan Dain Samples. Profile-driven Compilation. PhD thesis, U.C. Berkeley, April 1991. U.C. Berkeley CSD-91-627. http://citeseer.ist.psu.edu/736704.html More
@techreport{ samplesdidprofiledriven,
author = "Alan Dain Samples",
title = "Profile-Driven Compilation",
number = "CSD-91-627",
pages = "184",
url = "citeseer.ist.psu.edu/736704.html" }
Citations (may not include all citations):
242
Reference Manual (context) - Ellis, Stroustrup et al. - 1990
234
Cache Memories (context) - Smith - 1982
183
Profile Guided Code Positioning (context) - Pettis, Hansen - 1990
124
The Art of Computer Programming: Vol (context) - Knuth - 1973
107
Achieving High Instruction Cache Performance with an Optimiz.. (context) - Hwu - 1989
101
Programming with Sets: An Introduction to SETL (context) - Schwartz, Dewar et al. - 1986
93
Aspects of Cache Memory and Instruction Buffer Performance (context) - Hill - 1987
73
ATUM: A New Technique for Capturing Address Traces Using Mic.. (context) - Agarwal, Sites et al. - 1986
69
An Execution Profiler for Modular Programs (context) - Graham, Kessler et al. - 1983
66
Determining Average Program Execution Times and their Varian..
- Sarkar - 1989
44
Crafting a Compiler (context) - Fischer, LeBlanc - 1988
35
An Empirical Study of FORTRAN Programs (context) - Knuth - 1971
33
Mache: No-Loss Trace Compaction (context) - Samples - 1989
24
Design Decisions in SPUR (context) - Hill, Eggers et al. - 1986
16
Assembling Code for Machines with Span Dependent Instruction.. (context) - Szymanski - 1978
16
Adaptive Systems for the Dynamic Run-time Optimization of Pr.. (context) - Hansen - 1974
15
Optimal measurement points for program frequency counts (context) - Knuth, Stevenson - 1973
13
Planning and Coding of Problems for an Electronic Computing .. (context) - Goldstine, von Neumann - 1947
10
Cache management by the compiler (context) - Thabit - 1981
9
Cheap Dynamic Instruction Counting (context) - Weinberger - 1984
9
Dynamic Improvement of Locality in Virtual Memory Systems (context) - Baer - 1976
8
as Exemplified by the SETL Representation Sublanguage (context) - Dewar, Grand et al.
7
UNIX Programmer's Manual (context) - Laboratories - 1984
6
The Execution Time Profile as a Programming Tool (context) - Ingalls - 1972
5
Techniques for the Automatic Selection of Data Structures (context) - Low, Rovner - 1976
5
Taliere: An Interactive System for Data Structuring SETL Pro.. (context) - Straub - 1988
4
Automatic Construction of Algorithms and Data Structures usi.. (context) - Barstow - 1977
4
DineroIII Cache Simulator (context) - Hill - 1985
4
Automatic Data Structure Selection: An Example and Overview (context) - Low - 1978
3
Code Generation by Coagulation (context) - Karr - 1984
3
Optimizing Program Placement in Virtual Systems (context) - Ryder - 1974
3
Automatic Coding: Choice of Data Structures (context) - Low - 1974
3
On Convergence Toward a Database of Program Transformations (context) - Barstow
3
Recursive Data Types in SETL: Automatic Determination (context) - Weiss
2
Memory Hierarchy Aspects of a Multiprocessor RISC: Cache and.. (context) - Katz, Eggers et al. - 1985
2
Paragon: A Language Using Type Hierarchies for the Specifica.. (context) - Sherman - 1985
1
A Formilization for Modelling Structures and the Generation .. (context) - Rowe - 1976
1
User's Guide to the M5 Macro Language (context) - Samples - 1991
1
Courant Institute of Mathematical Sciences (context) - Fabri - 1979
1
Performance Polymorphism: Integrating Performance Constraint.. (context) - Kenny - 1989
1
yee A Structural Theory for Improving Software Reliability (context) - Cheung - 1974
1
Cheaper by the Dozen (context) - Jr, Carey - 1948
1
Instruction Set and Programmer's Manual (context) - Chow - 1986
1
Designing BiblioText: An Experiment in User Interface Design (context) - Vanter - 1988
1
Symposium on Architectural Support for Programming Languages.. (context) - McFarling - 1989
1
Long Address Traces for RISC Machines: Generation and Analys.. (context) - Borg, Kessler et al. - 1989
1
Improving Program Locality by Strategy-Oriented Restructurin.. (context) - Ferrari - 1974
1
Efficiency Considerations in Program Synthesis (context) - Kant - 1981
1
FETE -- A FORTRAN Execution Time Estimator (context) - Ingalls - 1971
1
Efficient Algorithms for Selecting Efficient Data Storage St.. (context) - Ramirez - 1980
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