Gang-Ryung Uh  Home/Search
Context Related
| fsu.edu/research/reports...TR971201.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: fsu.edu/research/reports/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This dissertation 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... (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):
47.5%: Effectively Exploiting Indirect Jumps - Uh, Whalley (1999) (Correct)
14.3%: Coalescing Conditional Branches into Efficient Indirect Jumps - Uh, Whalley (1997) (Correct)
Active bibliography (related documents): More All
0.5: RE2C - A More Versatile Scanner Generator - Bumbulis, Cowan (1994) (Correct)
0.5: Lucid and Efficient Case Analysis - Erlingsson, Krishnamoorthy, Raman (Correct)
0.2: Optimizing Pattern Matching - Le Fessant, Maranget (2001) (Correct)
Similar documents based on text: More All
1.5: Bounding Worst-Case Data Cache Performance - White (1996) (Correct)
0.7: Using a Swap Instruction to Coalesce Loads and Stores - Qasem (2001) (Correct)
0.5: Compiler Modifications To Support Interactive Compilation - Cai (2001) (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/article/uh97effectively.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/article/uh97effectively.html" }
Citations (may not include all citations):1575 Computer Architecture: A Quantitative Approach (context) - Hennessy, Patterson - 1996 ACM
296 Free Software Foundation (context) - Stallman, Porting et al. - 1990
230 Limits of instruction-level parallelism - Wall ACM DBLP
110 Improving the accuracy of dynamic branch prediction using br.. (context) - Pan, So et al. - 1992 ACM DBLP
96 Branch prediction for free - Ball, Larus - 1993 ACM DBLP
87 Computing Surveys (context) - Smith - 1982
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
66 Boosting beyond static scheduling in a superscalar processor - Smith, Lam et al. - 1990 ACM DBLP
43 Avoiding conditional branches by code replication (context) - Mueller, Whalley - 1995 ACM DBLP
39 Accurate static branch prediction by value range propagation - Patterson - 1995 ACM DBLP
38 Characterizing the impact of predicated execution on branch .. - Mahlke, Hank et al. - 1994 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
27 Guarded execution and branch prediction in dynamic ILP proce.. (context) - Pnevmatikatos, Sohi - 1994 ACM
21 A design environment for addressing architecture and compile.. - Davidson, Whalley - 1991
20 Eliminating branches using a superoptimizer and the gnu c co.. - Granlund, Kenner - 1992 ACM DBLP
18 Producing good code for the case statement (context) - Bernstein - 1985 ACM DBLP
15 Corpus-based static branch prediction - Calder, Grunwald et al. - 1995
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
12 Target prediction for indirect jumps (context) - Chang, Hao et al. - 1997
7 Optimization for a superscalar out-of-order machine (context) - Holler - 1996 ACM DBLP
6 Aggressive loop unrolling in a retargetable (context) - Davidson, Jinturkar - 1996
6 The implementation of case statements in Pascal (context) - Sale - 1981
5 Compiler code generation for multiway branch statements as a.. (context) - Spuler - 1994
3 Compilation of the Pascal case statement (context) - Hennessy, Mendelsohn - 1982 DBLP
3 Design and Optimization of Compilers (context) - Allen, Cocke - 1971
2 Toward real-time performace benchmarks for ADA (context) - Clapp, Duchesneau et al. - 1986
Documents on the same site (http://www.cs.fsu.edu/research/reports/): More
A Comparative Performance Analysis Of Real-Time Priority Queues - Mhatre (2001) (Correct)
Bounding Worst-Case Data Cache Performance - White (1996) (Correct)
The Weakest Precondition Protocol Analysis Environment - Yasinsac, Runy (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