See this document in CiteSeerX!

Improving Performance By Branch Reordering (1998)  (Make Corrections)  (6 citations)
Minghui Yang
SIGPLAN Conference on Programming Language Design and Implementation



  Home/Search   Context   Related

 
View or download:
fsu.edu/~whalley/pap...yang_thesis98.ps
fsu.edu/research/reports...TR980801.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  fsu.edu/~whalley/research (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: ix 1 INTRODUCTION 1 2 RELATED WORK 6 3 DETECTING A SEQUENCE OF REORDERABLE BRANCHES 9 3.1 Detecting a Sequence of Reorderable Branches with a Common Successor : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 9 3.2 Detecting a Sequence of Reorderable Range Conditions Comparing a Common Variable to Constants : : : : : : : : : : : : : : : 15 4 HANDLING SIDE EFFECTS IN A COMMON VARIABLE SEQUENCE 22 5 PERFORMING PROFILING 28 5.1 Producing Profile Information for Common Successor... (Update)

Context of citations to this paper:   More

.... For example, a simple BPF byte code program that matches TCP packets has the following form: lh [12] r0 jne r0, #ETHERTYPE IP, L5 lb [23], r1 jne r1, #IPPROTO TCP, L5 ret #TRUE L5: ret #FALSE Presuming Ethernet encapsulation, this filter first checks that the packet is an...

...0 1 1 0 Table 1. Predicate definition truth table. is changed to reduce the average depth traversed through a network of branches [22]. The final category of control flow optimization research focuses on the reduction of control dependence height. This work attempts to...

Cited by:   More
Branch Elimination via Multi-Variable Condition Merging - Kreahling, Whalley..   (Correct)
Program Decision Logic Optimization Using Predication And.. - Hwu, August, Sias (2001)   (Correct)
Systematic Compilation For Predicated Execution - August (2000)   (Correct)

Active bibliography (related documents):   More   All
0.5:   BPF+: Exploiting Global Data-flow Optimization in a.. - Begel, McCanne, Graham (1999)   (Correct)
0.3:   Effectively Exploiting Indirect Jumps - Uh (1997)   (Correct)
0.3:   Indirect Branch Prediction using Data Compression Techniques - Kalamatianos, Kaeli (1999)   (Correct)

Similar documents based on text:   More   All
0.6:   Avoiding Unconditional Jumps by Code Replication - Mueller (1992)   (Correct)
0.6:   On-Line Intrusion Detection Using Sequences of System Calls - Snyder (2001)   (Correct)
0.4:   Coalescing Conditional Branches into Efficient Indirect Jumps - Uh, Whalley (1997)   (Correct)

Related documents from co-citation:   More   All
5:   Avoiding conditional branches by code replication (context) - Mueller, Whalley - 1995
4:   Reverse If-Conversion - Warter, Mahlke et al. - 1993
4:   Interprocedural Conditional Branch Elimination - Bodik, Gupta et al. - 1997

BibTeX entry:   (Update)

Yang, M., Uh, G.-R., and Whalley, D. B. 1998. Improving performance by branch reordering. In ACM SIGPLAN Conference on Programming Language Design and Implementation. http://citeseer.ist.psu.edu/yang98improving.html   More

@inproceedings{ yang98improving,
    author = "Minghui Yang and Gang-Ryung Uh and David B. Whalley",
    title = "Improving Performance by Branch Reordering",
    booktitle = "{SIGPLAN} Conference on Programming Language Design and Implementation",
    pages = "130-141",
    year = "1998",
    url = "citeseer.ist.psu.edu/yang98improving.html" }
Citations (may not include all citations):
103   Predicting conditional branch directions from previous runs .. (context) - Fisher, Freudenberger - 1992
72   A Catalogue of Optimizing Transformations (context) - Allen, Cocke - 1971
64   Improving the accuracy of static branch prediction using bra.. (context) - Young, Smith - 1994  ACM   DBLP
43   Avoiding conditional branches by code replication (context) - Mueller, Whalley - 1995  ACM   DBLP
30   Interprocedural conditional branch elimination - Gupta, Bodik et al. - 1997  ACM   DBLP
25   Near-optimal intraprocedural branch alignment - Karger, Young et al. - 1997  ACM   DBLP
21   A design environment for addressing architecture and compile.. - Davidson, Whalley - 1991
14   A Tour Through the Portable C Compiler - Johnson - 1979
5   Compiler Code Generation for Multiway Branch Statements as a.. (context) - Spuler - 1987
4   Aggressive loop unrolling in a retargetable, optimizing comp.. (context) - Davidson, Jinturkar - 1996
3   Effectively Exploiting Indirect Jumps - Uh - 1997  ACM   DBLP
2   Coalescing conditional branches into efficient indirect jump.. - Uh, Whalley - 1997  ACM   DBLP
1   Toward real-time performance benchmarks for ada (context) - Volz, Mudge et al. - 1986  ACM   DBLP
1   Recuding branch costs via branch alignment (context) - Calder, Grunwald - 1994



The graph only includes citing articles where the year of publication is known.


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