(Enter summary)
Abstract: This paper describes a general code-improving transformation that can coalesce conditional branches
into an indirect jump from a table. Applying this transformation allows an optimizer to exploit
indirect jumps for many other coalescing opportunities besides the translation of multiway branch
statements. First, dataflow analysis is performed to detect a set of coalescent conditional branches,
which are often separated by blocks of intervening instructions. Second, several techniques are
applied ... (Update)
Context of citations to this paper: More
.... as techniques such as predicated execution [8] branch elimination [9] and coalescing of conditional branches into indirect jumps [10] become increasingly popular. By reducing the number of conditional branches (sometimes at the expense of extra indirect jumps [10]...
.... 14 2 PC=IC:0,L330; IC=r[8] 1; Bi: PC=IC:0,L330; IC=r[8] 1; Bi: a) Before Register Renaming (b) After Register Renaming Bj: r[8] W[r[14] .9 ibuf] 16) 16; r[9] W[r[14] 9 obuf] 16) 16; IC=r[9] r[8] PC=IC 0,L330; PC=IC 0,L330; r[10] W[r[14] 9 ibuf] 16) 16; r[9] W[r[14]...
Cited by: More
Indirect Branch Prediction using Data Compression Techniques - Kalamatianos, Kaeli (1999)
(Correct)
Improving Performance By Branch Reordering - Yang (1998)
(Correct)
Predicting Indirect Branches via Data Compression - Kalamatianos, al. (1998)
(Correct)
Similar documents (at the sentence level):
59.1%: Effectively Exploiting Indirect Jumps - Uh (1997)
(Correct)
7.8%: Coalescing Conditional Branches into Efficient Indirect Jumps - Uh, Whalley (1997)
(Correct)
Active bibliography (related documents): More All
0.2: Systematic Compilation For Predicated Execution - August (2000)
(Correct)
0.2: The Program Decision Logic Approach to Predicated.. - August, Sias, Puiatti, .. (1999)
(Correct)
0.2: Program Decision Logic Optimization Using Predication And.. - Hwu, August, Sias (2001)
(Correct)
Similar documents based on text: More All
0.2: Tools for Application-Oriented Performance Tuning - Mellor-Crummey, Fowler, Whalley (2001)
(Correct)
0.2: Using a Swap Instruction to Coalesce Loads and Stores - Qasem, Whalley, Yuan, van..
(Correct)
0.1: Automatic Validation of Code-Improving Transformations - van Engelen, Whalley, Yuan (2000)
(Correct)
Related documents from co-citation: More All
3: Interprocedural Conditional Branch Elimination
- Bodik, Gupta et al. - 1997
2: Characterizing the Impact of Predicated Execution on Branch Prediction
- Mahlke, Hank et al. - 1994
2: Target Prediction for Indirect Jumps
- Chang, Hao et al. - 1997
BibTeX entry: (Update)
G.R. Uh. Effectively Exploiting Indirect Jumps. PhD thesis, Florida State University, 1997. http://citeseer.ist.psu.edu/uh99effectively.html More
@article{ uh99effectively,
author = "Gang-Ryung Uh and David B. Whalley",
title = "Effectively exploiting indirect jumps",
journal = "Soft\-ware\emdash Prac\-tice and Experience",
volume = "29",
number = "12",
pages = "1061--1101",
year = "1999",
url = "citeseer.ist.psu.edu/uh99effectively.html" }
Citations (may not include all citations):
1575
Computer Architecture: A Quantitative Approach (context) - Hennessy, Patterson - 1996 ACM
234
Cache memories (context) - Smith - 1982 ACM DBLP
230
Limits of instruction-level parallelism
- Wall - 1991 ACM DBLP
110
Improving the accuracy of dynamic branch prediction using br.. (context) - Pan, So et al. - 1992 ACM DBLP
85
Reducing indirect function call overhead in C++ programs
- Calder, Grunwald - 1994 ACM DBLP
79
A portable global optimizer and linker (context) - Benitez, Davidson - 1988 ACM DBLP
66
Boosting beyond static scheduling in a superscalar processor
- Smith, Lam et al. - 1990 ACM DBLP
43
Using and Porting GNU CC (context) - Stallman - 1990
43
Avoiding conditional branches by code replication (context) - Mueller, Whalley - 1995 ACM DBLP
38
Characterizing the impact of predicated execution on branch ..
- Mahlke, Hank et al. - 1994 ACM DBLP
38
Target prediction for indirect jumps
- Chang, Hao et al. - 1997 ACM DBLP
34
Branch target buffer design and optimization (context) - Perleberg, Smith - 1993 ACM DBLP
30
Interprocedural conditional branch elimination
- Bodik, Gupta et al. - 1997 ACM DBLP
27
Guarded execution and branch prediction in dynamic ILP proce.. (context) - Pnevmatikatos, Sohi - 1994 ACM
14
A Tour Through the Portable C Compiler
- Johnson - 1979
13
Quick compilers using peephole optimizations
- Davidson, Whalley - 1989
13
Timing variation in dual-loop benchmarks
- Altman, Weiderman - 1987
7
Optimization for a superscalar out-of-order machine (context) - Holler - 1996 ACM DBLP
6
The implementation of case statements in Pascal (context) - Sale - 1981 DBLP
6
Improving performance by branch reordering
- Yang, Uh et al. - 1998 ACM DBLP
5
Compiler code generation for multiway branch statements as a.. (context) - Spuler - 1994
3
Design and Optimization of Compilers (context) - Allen, Cocke - 1971
2
Toward real-time performace benchmarks for ADA (context) - Clapp, Duchesneau et al. - 1986
1
A design environment for addressing architecture and compile.. (context) - Practice, Jan et al. - 1991
1
Aggressive loop unrolling in a retargetable (context) - Indirect, Delta et al. - 1996
Documents on the same site (http://www.cs.fsu.edu/~whalley/research.html): More
A Design Environment for Addressing Architecture and.. - Davidson, Whalley (1991)
(Correct)
Quick Compilers Using Peephole Optimization - Davidson, Whalley (1989)
(Correct)
Fast Context Switches: Compiler and Architectural Support .. - Snyder, Whalley, Baker
(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