I-Cheng K. Chen, Chih-Chieh Lee, Matthew A. Postiff, Trevor N. Mudge  Home/Search
Context
Related
| umich.edu/techrepo...CSETR30696.ps.Z umich.edu/techrepo...SETR30696.ps.gz umich.edu/~postiff...CSETR30696.ps.Z 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: umich.edu/~post...ublished.papers (more) From: umich.edu/DCO/techreports...cse96 (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Per-address two-level branch predictors have been shown to be among the best predictors and have been implemented in current microprocessors. However, as the cycle time of modern microprocessors continue to decrease, the implementation of set-associative per-address twolevel branch predictors will become more difficult. In this paper, we revisit and analyze an alternative tagless, direct-mapped approach which is simpler, requires lower power, and has faster access time. The tagless predictor... (Update)
Active bibliography (related documents): More All
0.8: Analysis of Branch Prediction via Data Compression - Chen, Coffey, Mudge (1996) (Correct)
0.7: Limits to Branch Prediction - Mudge, Chen, Coffey (1996) (Correct)
0.2: Scholarly Paper in Computer Engineering - Non-Thesis Option For (Correct)
Similar documents based on text: More All
0.3: Power Issues Related to Branch Prediction - Parikh, Skadron, Zhang.. (2001) (Correct)
0.2: A Cost-Effective Branch Target Buffer with a Two-Level.. - Ryotaro Kobayashi Yuji (1999) (Correct)
0.2: The Spineless Tagless G-Machine - NOT! - Hammond (1993) (Correct)
BibTeX entry: (Update)
@techreport{ chen96tagless,
author = "I-Cheng K. Chen and Chih-Chieh Lee and Matthew A. Postiff and Trevor N. Mudge",
title = "Tagless Two-level Branch Prediction Schemes",
number = "CSE-TR-306-96",
month = "24",
year = "1996",
url = "citeseer.ist.psu.edu/87077.html" }
Citations (may not include all citations):241 A study of branch prediction strategies (context) - Smith - 1981
214 Combining branch predictors - McFarling - 1993
147 Alternative implementation of Two-Level Adaptive Branch Pred.. - Yeh - 1992
146 A comparison of dynamic branch predictors that use two level.. - Yeh - 1993
110 Improving the accuracy of dynamic branch prediction using br.. (context) - Pan, Rahmeh - 1992
70 Two-level adaptive training branch prediction - Yeh - 1991
52 Branch classification: a new mechanism for improving branch .. - Chang, Hao et al. - 1994
52 Instruction Fetching: Coping with Code Bloat (context) - Uhlig, Nagle et al. - 1995
47 Correlation and aliasing in dynamic branch predictors (context) - Sechrest, Lee - 1996
43 ATOM: A flexible interface for building high performance pro.. (context) - Eustace, Srivastava - 1995
39 Analysis of branch prediction via data compression - Chen, Coffey et al. - 1996
31 A comprehensive instruction fetch mechanism for a processor .. - Yeh - 1992
22 accurate instruction fetch and branch prediction (context) - Calder - 1994
16 The role of adaptivity in two-level adaptive branch predicti.. (context) - Sechrest, Lee - 1995
9 Technical Manual (context) - CPU' - 1995
3 Optimal 2-bit branch predictors (context) - Nair - 1995
3 CA: MicroDesign Resources (context) - Report - 1995
Documents on the same site (http://www-personal.umich.edu/~postiffm/papers/published.papers.html): More
Exploiting Large Register Files in General Purpose Code - Author Info Removed (Correct)
The Need for Large Register Files in Integer Codes - Author Information Removed (Correct)
The Store-Load Address Table and Speculative Register Promotion - Author Info Removed (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