Cliff Young, David S. Johnson, David R. Karger, Michael D. Smith  Home/Search
Context Related
| mit.edu/pub/people...pldi96final.ps.gz harvard.edu/hube/publicatio...pldi97.ps 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: mit.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Branch alignment reorders the basic blocks of a program to minimize pipeline penalties due to control-transfer instructions. Prior work in branch alignment has produced useful heuristic methods. We present a branch alignment algorithm that usually achieves the minimum possible pipeline penalty and on our benchmarks averages within 0.3% of a provable optimum. We compare the control penalties and running times of our algorithm to an older, greedy approach and observe that both the greedy method... (Update)
Context of citations to this paper: More
...is definitely worthwhile to combine hotcold splitting with procedure placement techniques. Another similar technique is branch alignment [37,5]. It reorders basic blocks within each procedure to minimize branch penalties, which generally means minimizing the number of taken...
...memory can drastically a#ect performance due to negative branch and cache e#ects. Optimizations such as code layout [2] and branch alignment [1] reorder the basic blocks of a program to minimize these e#ects. While these optimizations do not change the graph structure of the...
Cited by: More
Code Placement for Improving Dynamic Branch Prediction - Accuracy Daniel Jimenez (Correct)
Boolean Formula-based Branch Prediction for Future.. - Daniel Jimenez Heather (2001) (Correct)
Infrastructure for Profile Driven Optimizations in GCC.. - Dvorak, Hubicka.. (2002) (Correct)
Active bibliography (related documents): More All
0.4: Path-based Compilation - Young (1998) (Correct)
0.4: The Asymmetric Traveling Salesman Problem.. - Cirasella.. (2000) (Correct)
0.3: Static Correlated Branch Prediction - Young, Smith (1999) (Correct)
Similar documents based on text: More All
0.1: Experimental Study of Minimum Cut Algorithms - Chekuri, Goldberg, Karger.. (1997) (Correct)
0.1: Rounding Algorithms for a Geometric Embedding of.. - Karger, Klein.. (1999) (Correct)
0.1: Approximation Schemes for Minimizing Average.. - Afrati, Bampis.. (1999) (Correct)
Related documents from co-citation: More All
9: Reducing Branch Costs via Branch Alignment - Calder, Grunwald - 1994
9: Profile guided code positioning (context) - Pettis, Hansen - 1990
8: Improving the accuracy of static branch prediction using branch correlation (context) - Young, Smith - 1994
BibTeX entry: (Update)
C. Young, D.S. Johnson, D.R. Karger, and M.D. Smith. "Near-optimal Intraprocedural Branch Alignment," Proc. ACM SIGPLAN 97 Conf. on Prog. Lang. Design and Impl. New York: ACM, June 1997. http://citeseer.ist.psu.edu/young97nearoptimal.html More
@inproceedings{ young97nearoptimal,
author = "Cliff Young and David S. Johnson and David R. Karger and Michael D. Smith",
title = "Near-optimal Intraprocedural Branch Alignment",
booktitle = "{SIGPLAN} Conference on Programming Language Design and Implementation",
pages = "183-193",
year = "1997",
url = "citeseer.ist.psu.edu/young97nearoptimal.html" }
Citations (may not include all citations):241 A Study of Branch Prediction Strategies (context) - Smith - 1981
185 Branch Prediction Strategies and Branch Target Buffer Design (context) - Lee, Smith - 1984
183 Profile Guided Code Positioning (context) - Pettis, Hansen - 1990
173 SUIF: An Infrastructure for Research on Parallelizing and Op.. - Wilson, French et al. - 1994
164 The Superblock: An Effective Technique for VLIW and Supersca.. (context) - Hwu - 1993
156 The Multiflow Trace Scheduling Compiler - Lowney, Freudenberger et al. - 1993
154 The traveling-salesman problem and minimum spanning trees: P.. (context) - Held, Karp - 1971
154 The traveling-salesman problem and minimum spanning trees (context) - Held, Karp - 1970
115 Program Optimization for Instruction Caches (context) - McFarling - 1989
107 Achieving High Instruction Cache Performance with an Optimiz.. (context) - Hwu, Chang - 1989
103 Predicting Conditional Branch Directions From Previous Runs .. (context) - Fisher, Freudenberger - 1992
84 Reducing the Cost of Branches (context) - McFarling, Hennessy - 1986
64 Improving the Accuracy of Static Branch Prediction Using Bra.. (context) - Young, Smith - 1994
62 A Comparative Analysis of Schemes for Correlated Branch Pred.. - Young, Gloy et al. - 1995
62 Large-step Markov chains for the traveling salesman problem - Martin, Otto et al. - 1991
56 The Traveling Salesman Problem: A Case Study in Local Optimi.. (context) - Johnson, McGeoch - 1997
51 Optimizing Instruction Cache Performance for Operating Syste.. - Torrellas, Xia et al. - 1995
43 Avoiding Conditional Branches by Code Replication (context) - Mueller, Whalley - 1995
42 Extending SUIF for Machine-dependent Optimizations - Smith - 1996
34 Alpha 21164 Microprocessor Hardware Reference Manual (context) - Semiconductor - 1995
24 A patching algorithm for the non-symmetric traveling salesma.. (context) - Karp - 1979
20 Exact solution of large asymmetric traveling salesman proble.. (context) - Miller, Pekny - 1991
20 Improving Semi-static Branch Prediction by Code Replication - Krall - 1994
19 Asymptotic Experimental Analysis for the Held-Karp Traveling.. (context) - Johnson, McGeoch et al. - 1996
18 Performance of linearspace search algorithms (context) - Zhang, Korf - 1996
16 Local search for the asymmetric traveling salesman problem (context) - Kanellakis, Papadimitriou - 1980
7 Delivering Binary Object Modification Tools for Program Anal.. (context) - Wilson, Neth et al. - 1996
7 Finding cuts in the TSP (A preliminary report - Applegate, Bixby et al.
5 Upper and Lower Bounding Procedures for the Asymmetric Trave.. (context) - Repetto - 1994
5 Branch Instrumentation in SUIF - Young, Smith - 1996
4 Improving UNIX Kernel Performance Using Profile Based Optimi.. (context) - Speer, Kumar et al. - 1994
1 FDPR/2: A Code Instrumentation and Restructuring Tool for OS.. (context) - Chow - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.jussieu.fr/~fermigie/fermivista/ftp/theory.lcs.mit.edu.html): More
Studies in Secure Multiparty Computation and Applications - Canetti (1995) (Correct)
Machine Learning (Lecture notes 13) - Rivest (1994) (Correct)
Scheduling Multithreaded Computations by Work Stealing - Blumofe, Leiserson (1994) (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