Article

Free access

Reducing branch misprediction penalties via dynamic control independence detection

Authors:

Yuan Chou,

Jason Fung,

John Paul ShenAuthors Info & Claims

ICS '99: Proceedings of the 13th international conference on Supercomputing

Pages 109 - 118

https://doi.org/10.1145/305138.305175

Published: 01 May 1999 Publication History

PDF eReader

References

[1]

M. johnson, Superscalar Processor Design, Prentice-Hall, pp 110, 1990.

Google Scholar

[2]

Dirk Gmnwald, Artur Klauser, Srilatha Manne and Andrew Pleszkun, "Confidence Estimation for Speculation Control," in Prec. of25th ISCA, pp 122-131, 1998.

Digital Library

Google Scholar

[3]

Erik Jacobsen, Eric Rotenberg and J. E. Smith, "Assigning Confidence to Conditional Branch Predictors," in Prec. of 29th MICRO, pp 142-152, 1996.

Digital Library

Google Scholar

[4]

A. Sfivastava and A. Eustace, "ATOM: A System for Building Customized Program Analysis Tools," in Prec. of PLDI, pp 196-205, June 1994.

Digital Library

Google Scholar

[5]

Alpha Architecture Handbook, Digital Equipment Corporation, 1992.

Google Scholar

[6]

Yuan Chou, Jason Fung, and John P. Shen, "Reducing Branch Misprediction Penalties Via Dynamic Control Independence Detection," CMuART Tech. Report, Carnegie Mellon Univ., Mar. 1999

Google Scholar

[7]

Scott McFarling, "Combining Branch Predictors," Technical Report TN-36, DEC-WRL, June 1993.

Google Scholar

[8]

IBM Microelectronics Division, PowerPC 604 RISC Microprocessor User's Manual, 1994.

Google Scholar

[9]

Linley Gwennap, "Intel's P6 Uses Deeoupled Supersealar Design," in Microprocessor Report, Vol, 9, Issue 2, Feb. 1995.

Google Scholar

[10]

P.Y.T Hsu, "Highly Concurrent Scalar Processing," Ph.D. Thesis, University of Illinois, 1986.

Digital Library

Google Scholar

[11]

David I. August, Wen-reel W. Hwu, and Scott A. Mahlke, "A Framework for Balancing Control Flow and Predication," in Proc. of 30th MICRO, pp 92-103, 1997.

Digital Library

Google Scholar

[12]

Linley Gwennap, "Design Concepts for Merced," in Microprocessor Report, Vol. 11, Issue 3, Mar. 1997.

Google Scholar

[13]

Timothy Heil and James Smith, "Selective Dual Path Execution,'' University of Wisconsin-Madison, Nov. 1996.

Google Scholar

[14]

Gary Tyson, Kelsey Lick, and Matthew Fattens, "Limited Dual Path Execution," CSE-TR 346-97, Univ. of Michigan, 1997.

Google Scholar

[15]

Augustus. K. Uht, Vijay Sindagi, and Kelley Hall, "Disjoint Eager Execution: An Optimal Form of Speculative Execution,'' in Proc. of 28th MICRO, pp 313-325,1995.

Digital Library

Google Scholar

[16]

Artur Klauser, Abhijit Paithankar, and Dirk Grunwald, "Selective Eager Execution on the PolyPath Architecture," in Proc. of 25th ISCA, pp 250-259, 1998.

Digital Library

Google Scholar

[17]

Steven Wallace, Brad Calder and Dean M. Tullsen, "Threaded Multiple Path Execution," in Proc. of 25th ISCA, 1998.

Digital Library

Google Scholar

[18]

M. Lam and FL Wilson, "Limits of Control Flow on Parallelism,'' in Proceedings of 19th ISCA, pp 46-57, June 1992.

Digital Library

Google Scholar

[19]

Eric Rotenberg, Quinn Jacobson, Yiannakis Sazeides, and Jim Smith, "Trace Processors," in Proc. 30th MICRO, 1997.

Digital Library

Google Scholar

[20]

Eric Rotenberg, Quinn Jacobson, and Jim Smith, "A Study of Control Independence in Superscalar Processors," in Proc. of 5th HPCA, 1999.

Digital Library

Google Scholar

[21]

Avinash Sodani and Guri Sohi, "Dynamic instruction Reuse," in Proc. of 24th iSCA, 1997.

Digital Library

Google Scholar

Cited By

View all

Monde AYamauchi YKijima SMasafumi Y(2021)Can a Skywalker Localize the Midpoint of a Rope?ACM Transactions on Computation Theory10.1145/346095413:3(1-23)Online publication date: 18-Jul-2021
https://dl.acm.org/doi/10.1145/3460954
Chillara S(2021)On Computing Multilinear Polynomials Using Multi-r-ic Depth Four CircuitsACM Transactions on Computation Theory10.1145/346095213:3(1-21)Online publication date: 18-Jul-2021
https://dl.acm.org/doi/10.1145/3460952
(2021)A Polynomial Time Algorithm for 3SATACM Transactions on Computation Theory10.1145/346095013:3(1-13)Online publication date: 18-Jul-2021
https://dl.acm.org/doi/10.1145/3460950
Show More Cited By

Index Terms

Recommendations

Reducing branch misprediction penalties via adaptive pipeline scaling
HiPEAC'07: Proceedings of the 2nd international conference on High performance embedded architectures and compilers

Pipeline scaling provides an attractive solution for increasingly serious branch misprediction penalties within deep pipeline processor. In this paper we investigate Adaptive Pipeline Scaling (APS) techniques that are related to reducing branch ...
Reducing Branch Misprediction Penalty via Selective Branch Recovery
HPCA '04: Proceedings of the 10th International Symposium on High Performance Computer Architecture

Branch misprediction penalty consists of two components: the time wasted on mis-speculative execution until the mispredicted branch is resolved and the time to restart the pipeline with useful instructions once the branch is resolved. Current processor ...
Fast branch misprediction recovery in out-of-order superscalar processors
ICS '05: Proceedings of the 19th annual international conference on Supercomputing

Current trends in modern out-of-order processors involve implementing deeper pipelines and a large instruction window to achieve high performance. However, as pipeline depth increases, the branch misprediction penalty becomes a critical factor in ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ICS '99: Proceedings of the 13th international conference on Supercomputing

June 1999

509 pages

ISBN:158113164X

DOI:10.1145/305138

Chairmen:
Theodore Papatheodorou
Univ. of Patras, Patras, Greece
,
Mateo Valero
Univ. Politècnica de Catalunya, Barcelona, Spain
,
Constantine D. Polychronopoulos
Univ. of Illinois
,
Yoichi Muraoka
Waseda Univ.
,
Jesus Labarta
Univ. Politècnica de Catalunya, Barcelona, Spain

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ICS99

Sponsor:

SIGARCH

ICS99: The 13th ACM International Conference on Supercomputing

June 20 - 25, 1999

Rhodes, Greece

Acceptance Rates

ICS '99 Paper Acceptance Rate 57 of 180 submissions, 32%;

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

39
Total Citations
View Citations
698
Total Downloads

Downloads (Last 12 months)77
Downloads (Last 6 weeks)7

Reflects downloads up to 21 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Monde AYamauchi YKijima SMasafumi Y(2021)Can a Skywalker Localize the Midpoint of a Rope?ACM Transactions on Computation Theory10.1145/346095413:3(1-23)Online publication date: 18-Jul-2021
https://dl.acm.org/doi/10.1145/3460954
Chillara S(2021)On Computing Multilinear Polynomials Using Multi-r-ic Depth Four CircuitsACM Transactions on Computation Theory10.1145/346095213:3(1-21)Online publication date: 18-Jul-2021
https://dl.acm.org/doi/10.1145/3460952
(2021)A Polynomial Time Algorithm for 3SATACM Transactions on Computation Theory10.1145/346095013:3(1-13)Online publication date: 18-Jul-2021
https://dl.acm.org/doi/10.1145/3460950
Hajiabadi ADiavastos ACarlson TSherwood TBerger EKozyrakis C(2021)NOREBA: a compiler-informed non-speculative out-of-order commit processorProceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3445814.3446726(182-193)Online publication date: 19-Apr-2021
https://dl.acm.org/doi/10.1145/3445814.3446726
Adileh ALilja DEeckhout LOskin MInoue K(2018)Architectural support for probabilistic branchesProceedings of the 51st Annual IEEE/ACM International Symposium on Microarchitecture10.1109/MICRO.2018.00018(108-120)Online publication date: 20-Oct-2018
https://dl.acm.org/doi/10.1109/MICRO.2018.00018
Kothinti Naresh VSheikh RPerais ACain H(2018)SPF: Selective Pipeline Flush2018 IEEE 36th International Conference on Computer Design (ICCD)10.1109/ICCD.2018.00032(152-155)Online publication date: Oct-2018
https://doi.org/10.1109/ICCD.2018.00032
Mao MAn HSun TLi QDeng BWei XZhou J(2012)Distributed Control Independence for Composable Multi-processorsProceedings of the 2012 IEEE/ACIS 11th International Conference on Computer and Information Science10.1109/ICIS.2012.45(124-129)Online publication date: 30-May-2012
https://dl.acm.org/doi/10.1109/ICIS.2012.45
Samie FBaniasadi A(2011)Power and frequency analysis for data and control independence in embedded processorsProceedings of the 2011 International Green Computing Conference and Workshops10.1109/IGCC.2011.6008593(1-6)Online publication date: 25-Jul-2011
https://dl.acm.org/doi/10.1109/IGCC.2011.6008593
Hilton AEswaran NRoth A(2009)CPROBProceedings of the 2009 18th International Conference on Parallel Architectures and Compilation Techniques10.1109/PACT.2009.42(159-168)Online publication date: 12-Sep-2009
https://dl.acm.org/doi/10.1109/PACT.2009.42
Golander AWeiss S(2009)Reexecution and Selective Reuse in Checkpoint ProcessorsTransactions on High-Performance Embedded Architectures and Compilers II10.1007/978-3-642-00904-4_13(242-268)Online publication date: 22-Apr-2009
https://dl.acm.org/doi/10.1007/978-3-642-00904-4_13
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Reducing branch misprediction penalties via adaptive pipeline scaling

Reducing Branch Misprediction Penalty via Selective Branch Recovery

Fast branch misprediction recovery in out-of-order superscalar processors