See this document in CiteSeerX!

Predicting Indirect Branches via Data Compression (1998)  (Make Corrections)  (10 citations)
John Kalamatianos, et al.
International Symposium on Microarchitecture



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
neu.edu/info/architectu...micro98.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  neu.edu/info/archi...publications (more)
(Enter author homepages)

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

Abstract: Branch prediction is a key mechanism used to achieve high performance on multiple issue, deeply pipelined processors. By predicting the branch outcome at the instruction fetch stage of the pipeline, superscalar processors are better able to exploit Instruction Level Parallelism (ILP) by providing a larger window of instructions. However, when a branch is mispredicted, instructions from the mispredicted path must be discarded. Therefore, branch prediction accuracy is critical to achieve high... (Update)

Context of citations to this paper:   More

...branches predict the next indirect branch better. For some individual branches this may be wrong (as suggested by Kalamatianos and Kaeli [81], who dynamically choose a pure indirect or a mixed conditional indirect trace for each branch) but over the whole benchmark suite, this...

...component, leading to an underutilization of the available resources. For detailed simulation results on a tagless PPM predictor see [145]. The simulation results in this thesis will correspond to tagged implementations only. The PPM predictor works as follows. The BIU unit...

Cited by:   More
The Structure and Performance of Efficient Interpreters - Ertl, Gregg (2003)   (Correct)
Memory Expansion Technology (MXT): Software support .. - Abali, Franke.. (2001)   (Correct)
Improving Branch Predictors by Correlating on Data Values - Heil, Smith, Smith (1999)   (Correct)

Similar documents (at the sentence level):   More
36.1%:   Indirect Branch Prediction using Data Compression Techniques - Kalamatianos, Kaeli (1999)   (Correct)
14.4%:   Microarchitectural and Compile-Time Optimizations for.. - Kalamatianos (2000)   (Correct)
10.1%:   Improving the Accuracy of Indirect Branch Prediction via.. - Kalamatianos, Kaeli (1999)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Software and Hardware Techniques for Efficient Polymorphic Calls - Driesen (1999)   (Correct)
0.3:   Improving Performance By Branch Reordering - Yang (1998)   (Correct)
0.2:   Variable Length Path Branch Prediction - Stark, al. (1998)   (Correct)

Similar documents based on text:   More   All
1.0:   Rehashable BTB: An Adaptive Branch Target Buffer to Improve .. - Li, Bhargava, John (2002)   (Correct)
0.4:   A Comprehensive Front-End Architecture for the - Gifford, Huang, Yang, Yu (2003)   (Correct)
0.2:   Analysing a Multistreamed Superscalar Speculative Instruction .. - Santos, Navaux   (Correct)

Related documents from co-citation:   More   All
7:   Analysis of Branch Prediction via Data Compression - Chen, Coffey et al. - 1996
7:   Accurate Indirect Branch Prediction - Driesen, Holzle - 1998
5:   Combining branch predictors - McFarling - 1993

BibTeX entry:   (Update)

J. Kalamatianos and D. R. Kaeli. Predicting indirect branches via data compression. In Proceedings of the 31st Annual ACM/IEEE International Symposium on Microarchitecture, pages 272--81, Dec. 1998. http://citeseer.ist.psu.edu/kalamatianos98predicting.html   More

@inproceedings{ kalamatianos98predicting,
    author = "John Kalamatianos and David R. Kaeli",
    title = "Predicting Indirect Branches via Data Compression",
    booktitle = "International Symposium on Microarchitecture",
    pages = "272-281",
    year = "1998",
    url = "citeseer.ist.psu.edu/kalamatianos98predicting.html" }
Citations (may not include all citations):
1002   Programming Language (context) - Stroustrup - 1991
443   Improving Direct Mapped Cache Performance by the Addition of.. - Jouppi - 1990
386   ATOM : A System for Building Customized Program Analysis too.. (context) - Srivastava, Eustace - 1994
185   Branch Prediction Strategies and Branch Target Buffer Design (context) - Lee, Smith - 1984
148   Data Compression using Adaptive Coding and Partial String Ma.. - Cleary, Witten - 1984
147   Alternative Implementations of Two-Level Adaptive Branch Pre.. - Yeh, Patt - 1992
146   A Comparison of Dynamic Branch Predictors that use Two Level.. - Yeh, Patt - 1993  ACM   DBLP
85   Reducing Indirect Function Call Overhead in C++ Programs - Calder, Grunwald - 1994  ACM   DBLP
70   Two-Level Adaptive Training Branch Prediction - Yeh, Patt - 1991  ACM   DBLP
66   Quantifying Behavioral Differences between C and C++ program.. - Calder, Grunwald et al. - 1994
61   Execution Characteristics of Desktop Applications on Windows.. - Lee, Crowley et al. - 1998  ACM   DBLP
59   Branch History Table Prediction of moving Target Branches du.. (context) - Kaeli, Emma - 1991  ACM   DBLP
51   Predicting File System Actions from Prior Events - Kroeger, Long - 1996
40   Accurate Indirect Branch Prediction - Driesen, Holzle - 1998  ACM   DBLP
39   Analysis of Branch Prediction via Data Compression - Chen, Coffey et al. - 1996  ACM   DBLP
38   Target Prediction for Indirect Jumps - Chang, Hao et al. - 1997
38   Characterizing the Impact of Predicated Execution on Branch .. - Mahlke, Hank - 1994
35   Implementations of context-based value predictors - Sazeides, Smith - 1997
32   Link-Time Optimization of Address Calculation on a 64-bit Ar.. - Srivastava, Wall - 1994  ACM   DBLP
30   Interprocedural Conditional Branch Elimination - Bodik, Gupta et al. - 1997  ACM   DBLP
16   Branch Effects Reduction Techniques (context) - Uht, Sindagi et al. - 1997
13   Improving the Accuracy of History-based Branch Prediction - Kaeli, Emma - 1997  ACM
8   Limits of Indirect Branch Prediction - Driesen, Holzle - 1997
4   Improving Indirect Branch Prediction with Source- and Arity-.. - Driesen, Holzle - 1998
3   Effectively Exploiting Indirect Jumps - Uh - 1997  ACM   DBLP



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


Documents on the same site (http://www.ece.neu.edu/info/architecture/publications.html):   More
Procedure Mapping Using Static Call Graph Estimation - Hashemi, Kaeli, Calder (1997)   (Correct)
Temporal-based Procedure Reordering for Improved.. - Kalamatianos, Kaeli (1998)   (Correct)
Branch-directed and Pointer-based Data Cache Prefetching - Liu, Dimitri, Kaeli (1999)   (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