(Enter summary)
Abstract: As the gap between memory and processor performance
continues to grow, it becomes increasingly important
to exploit cache memory effectively. One technique
used by compiler and linkers to improve the performance
of the cache is code reordering. Code reordering
optimizations rearrange a program so that
sections of the program with temporal locality will be
placed next to each other in the final program layout.
A number of software approaches to code reordering
have been proposed. Their goal is... (Update)
Context of citations to this paper: More
.... previous work There has been a considerable amount of work done on code positioning for improved instruction cache performance [2, 3, 4, 6, 7, 8, 9, 10, 11]. We next discuss some of this work, as it relates to our algorithm. In [9] McFarling proposes a basic block remapping...
.... There has been a considerable amount of work done on code repositioning for improved instruction cache performance [3] 5] 6] 7] [8], 9] 10] In the following section we discuss some of this work, as it relates to our work here. A. Related Work Pettis and Hansen [3]...
Cited by: More
Microarchitectural and Compile-Time Optimizations for.. - Kalamatianos (2000)
(Correct)
Accurate Simulation and Evaluation of Code Reordering - Kalamatianos, Kaeli (2000)
(Correct)
Analysis of Temporal-Based Program Behavior for.. - Kalamatianos.. (1999)
(Correct)
Similar documents (at the sentence level):
31.0%: Procedure Mapping Using Static Call Graph Estimation - Hashemi, Kaeli, Calder (1997)
(Correct)
Active bibliography (related documents): More All
0.1: Cache Line Coloring Procedure Placement Using Real and.. - Hashemi, Kaeli, Calder
(Correct)
0.1: Static Branch Frequency and Program Profile Analysis - Wu, Larus (1994)
(Correct)
0.1: Structural And Static Analysis Techniques For Enhancing Compiler.. - Crozier (1999)
(Correct)
Similar documents based on text: More All
0.2: Efficient Procedure Mapping Using Cache Line Coloring - Amir Hashemi (1996)
(Correct)
0.2: Efficient Procedure Mapping using Cache Line Coloring - Hashemi, Kaeli, Calder (1996)
(Correct)
0.1: Timestamped Whole Program Path Representation and its.. - Zhang, Gupta (2001)
(Correct)
Related documents from co-citation: More All
4: Optimizing Instruction Cache Performance for Operating System Intensive Workload..
- Torrellas, Xia et al. - 1995
4: Efficient procedure mapping using cache line coloring
- Hashemi, Kaeli et al. - 1996
4: Profile guided code positioning (context) - Pettis, Hansen - 1990
BibTeX entry: (Update)
A. Hashemi, D. R. Kaeli, and B. Calder. Procedure Mapping using Static Call Graph Estimation. In Proceedings of the Workshop on Interaction between Compiler and Computer Architecture, February 1997. http://citeseer.ist.psu.edu/article/hashemi97procedure.html More
@misc{ hashemi97procedure,
author = "A. Hashemi and D. Kaeli and B. Calder",
title = "Procedure Mapping using Static Call Graph Estimation",
text = "A. Hashemi, D. R. Kaeli, and B. Calder. Procedure Mapping using Static
Call Graph Estimation. In Proceedings of the Workshop on Interaction between
Compiler and Computer Architecture, February 1997.",
year = "1997",
url = "citeseer.ist.psu.edu/article/hashemi97procedure.html" }
Citations (may not include all citations):
625
A Mathematical Theory of Evidence (context) - Shafer - 1976
386
ATOM: A system for building customized program analysis tool.. (context) - Srivastava, Eustace - 1994
241
A study of branch prediction strategies (context) - Smith - 1981
183
Profile guided code positioning (context) - Pettis, Hansen - 1990
156
The multiflow trace scheduling compiler
- Lowney, Freudenberger et al. - 1993
115
Program optimization for instruction caches (context) - McFarling - 1989
107
Achieving high instruction cache performance with an optimiz.. (context) - Hwu, Chang - 1989
96
Branch prediction for free
- Ball, Larus - 1993
94
Using profile information to assist classic compiler code op..
- Chang, Mahlke et al. - 1991
84
Reducing the cost of branches (context) - McFarling, Hennessy - 1986
79
A generalization of bayesian inference (context) - Dempster - 1968
47
Efficient procedure mapping using cache line coloring
- Hashemi, Kaeli et al. - 1996
40
Accurate static estimators for program optimization (context) - Wagner, Maverick et al. - 1994
35
Evidencebased static branch prediction using machine learnin..
- Calder, Grunwald et al. - 1997
33
Superblock formation using static program analysis
- Hank, Mahlke et al. - 1993
27
Static branch frequency and program profile analysis
- Wu, Larus - 1994
11
Discrete markov analysis of computer programs (context) - Ramamoorthy - 1965
Documents on the same site (http://www-cse.ucsd.edu/users/calder/papers.html): More
Dynamic Hammock Predication for Non-predicated.. - Klauser, Austin.. (1998)
(Correct)
A Comparison of Software Code Reordering and Victim Buffers - Bahar, Calder, Grunwald (1999)
(Correct)
Predictive Techniques for Aggressive Load Speculation - Reinman, Calder (1998)
(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