Article

Free access

Analyzing the working set characteristics of branch execution

Authors:

Sangwook P. Kim,

Gary S. TysonAuthors Info & Claims

MICRO 31: Proceedings of the 31st annual ACM/IEEE international symposium on Microarchitecture

Pages 49 - 58

Published: 01 November 1998 Publication History

PDF eReader

References

[1]

J.E. Smith, "A study of branch prediction strategies," In Proceedings of the 8th International Symposium on Computer Architecture, pp. 135-148, May 1981.

Digital Library

Google Scholar

[2]

T.-Y. Yeh and Y.N. Part, "Two-level Adaptive Training Branch Prediction", in Proceedings of the 24th International Symposium on Microarchitecture, 1991.

Digital Library

Google Scholar

[3]

T.-Y. Yeh and Y.N. Patt, "Alternative Implementations of Two-level Adaptive Branch Prediction", in Proceedings of the 19th International Symposium on Computer Architecture, 1992.

Digital Library

Google Scholar

[4]

S.-T. Pan, K. So, and J. T. Rahmeh. "Improving the accuracy of dynamic branch prediction using branch correlation'', in Proceeding of the 5th International Conference on Architectural Support for Programming Languages and Operating Systems, pages 76-84, Boston, .Mass., October 1992.

Digital Library

Google Scholar

[5]

T. Ball and J.R. Larus, "Branch prediction for free", in Proceedings of SIGPLAN Conference on Programming Language Design and Implementation, June 1993.

Digital Library

Google Scholar

[6]

S. McFarling, "Combining branch predictors", TN 36, DEC-WRL, June 1993.

Google Scholar

[7]

Brad Calder and Dirk Grunwald, "Reducing Branch Costs via Branch Alignment", in Proceedings of the 6th International Conference on Architectural Support for Programming Languages and Operating Systems, Oct. 1994.

Digital Library

Google Scholar

[8]

C. Young and M.D. smith, "improving the Accuracy of Static Branch Prediction Using Branch Correlation", in Proceedings of ASPLOS VI, Oct. 1994.

Digital Library

Google Scholar

[9]

P.-Y. Chang, E. Hao, T.-Y. Yeh, and Y.N. Patt, "Branch Classification: a New Mechanism for Improving Branch Predictor Performance", in Proceedings of the 27th International Symposium on Microarchitecture, 1994.

Digital Library

Google Scholar

[10]

C. Young, N. Gloy, and M.D. Smith, "A Comparative Analysis of Schemes for Correlated Branch Prediction", in Proceedings of the 22nd Annual International Symposium on Computer Architecture, 1995.

Digital Library

Google Scholar

[11]

A. R. Talcott, M. Nemirovsky, and R.C. Wood, "The Influence of Branch Prediction Table Interference on Branch Prediction Scheme Performance", in Proceedings of International Conference on Parallel Architectures and Compilation Techniques, 1995.

Digital Library

Google Scholar

[12]

Brad Calder, Dirk Grunwald, Donald Lindsay, James Martin, Michael Mozer, and Benjamin Zorn, "Corpusbased Static Branch Prediction", in Proceedings of the SIG- PLAN Conference on Programming Language Design and Implementation, June 1995.

Digital Library

Google Scholar

[13]

J.R.C. Patterson, "Accurate Static Branch Prediction by Value Range Propagation", in Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, June 1995.

Digital Library

Google Scholar

[14]

P.-Y. Chang, E. Hao, and Y.N. Patt, "Alternative Implementations of Hybrid Branch Predictors", in Proceedings of the 28th International Symposium on Microarchitecture, 1995.

Digital Library

Google Scholar

[15]

P.-Y. Chang, M. Evers, and Y.N. Patt, "Improving branch prediction accuracy by reducing pattern history table interference'', in Proceedings of the 1996 ACM/IEEE Conference on Parallel Architecture and Compilation Techniques, 1996.

Digital Library

Google Scholar

[16]

S. A. Mahlke and B. Natarajan, "Compiler Synthesized Dynamic Branch Prediction", in Proceedings of the 29th International Symposium on Microarchitecture, 1996.

Digital Library

Google Scholar

[17]

C. Young, D. S. johnson, D. R. Karger, and M.D. Smith, "Near-optimal Intraprocedural Branch Alignment", in Proceedings of PLDI, June 1997.

Digital Library

Google Scholar

[18]

Eric Sprangle, Robert S. Chappell, Mitch Alsup, and Yale N. Part, "The Agree Predictor: A Mechanism for Reducing Negative Branch History Interference" in Proceedings of the 24th International Symposium on Computer Architecture, Denver, June 1997.

Digital Library

Google Scholar

[19]

N. Gloy, T Blackwell, M.D. Smith, and B. Calder, "Procedure Placement Using Temporal Ordering Information", in Proceedings of the 30th International Symposium on Microarchitecture, Dec. 1997.

Digital Library

Google Scholar

[20]

J. Stark, P. Racunas, and Y. N. Patt, "Reducing the performance impact of instruction cache misses by writing instructions into the reservation stations out-of-order", in Proceedings of the 30th Annual ACM/IEEE International Symposium on Microarchitecture, 1997.

Digital Library

Google Scholar

[21]

Steven S. Muchnick, "Advanced Compiler Design & Implementation", 1997.

Digital Library

Google Scholar

[22]

TM. Austin and D. Burger, "The SimpleScalar Tool Set, Version 2.0", 1997.

Google Scholar

[23]

T Ball, P. Mataga, and M. Sagiv, "Edge Profiling versus Path Profiling: The Showdown", in proceeding of the 25th ACM Symposium on Principles of Programming Languages, Jan. 1998.

Digital Library

Google Scholar

[24]

Marius Evers, Sanjay J. Patel, Robert S. Chappell, Yale N. Patt, "Analysis of Correlation and Predictability: What Makes Two-Level Branch Predictors Work," in Proceedings of the 25th International Symposium on Computer Architecture, Barcelona, June 1998.

Digital Library

Google Scholar

[25]

B. Deitrich, B. Cheng, and W. Hwu, "Improving Static Branch Prediction in a Compiler", in Proceedings of International Conference on Parallel Architectures and Compilation Techniques, 1998.

Digital Library

Google Scholar

[26]

J. Kalamatianos and D. Kaeli, "Temporal-based Procedure Reordering for Improved Instruction Cache Performance'', in Proceedings of the 4th International Symposium on High Performance Computer Architecture, 1998.

Digital Library

Google Scholar

Cited By

View all

Desmet VVandierendonck HDe Bosschere K(2007)Clustered indexing for branch predictorsMicroprocessors & Microsystems10.1016/j.micpro.2006.08.00331:3(168-177)Online publication date: 1-May-2007
https://dl.acm.org/doi/10.1016/j.micpro.2006.08.003
Jiménez DSarkar VHall M(2005)Code placement for improving dynamic branch prediction accuracyProceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation10.1145/1065010.1065025(107-116)Online publication date: 12-Jun-2005
https://dl.acm.org/doi/10.1145/1065010.1065025
Jiménez D(2005)Code placement for improving dynamic branch prediction accuracyACM SIGPLAN Notices10.1145/1064978.106502540:6(107-116)Online publication date: 12-Jun-2005
https://dl.acm.org/doi/10.1145/1064978.1065025

Index Terms

Analyzing the working set characteristics of branch execution
1. Computer systems organization
  1. Embedded and cyber-physical systems
    1. Embedded systems
2. Hardware
  1. Electronic design automation
    1. Methodologies for EDA
  2. Integrated circuits
    1. Logic circuits
      1. Arithmetic and datapath circuits
      2. Design modules and hierarchy

Recommendations

The effects of predicated execution on branch prediction
MICRO 27: Proceedings of the 27th annual international symposium on Microarchitecture

High performance architectures have always had to deal with the performance limiting impact of branch operations. Microprocessor designs are going to have to deal with this problem as well, as they move towards deeper pipelines and support for multiple ...
Speculative execution and branch prediction on parallel machines
ICS '93: Proceedings of the 7th international conference on Supercomputing

Several recent studies on the limits of parallelism have reported that speculative execution can substantially increase the amount of exploitable parallelism in programs, especially non-numerical programs. This is true even for parallel machines models ...
Characterizing the impact of predicated execution on branch prediction
MICRO 27: Proceedings of the 27th annual international symposium on Microarchitecture

Branch instructions are recognized as a major impediment to exploiting instruction level parallelism. Even with sophisticated branch prediction techniques, many frequently executed branches remain difficult to predict. An architecture supporting ...

Comments

Information & Contributors

Information

Published In

MICRO 31: Proceedings of the 31st annual ACM/IEEE international symposium on Microarchitecture

November 1998

321 pages

ISBN:1581130163

Chairmen:
Jim Bondi
Texas Instruments
,
Jim Smith
Univ. of Wisconsin

Publisher

IEEE Computer Society Press

Washington, DC, United States

Publication History

Published: 01 November 1998

Check for updates

Qualifiers

Article

Conference

MICRO98

Sponsor:

SIGMICRO
IEEE-CS\TCMM

MICRO98: 31st International Symposium on Microarchitecture

Texas, Dallas, USA

Acceptance Rates

MICRO 31 Paper Acceptance Rate 28 of 108 submissions, 26%;

Overall Acceptance Rate 484 of 2,242 submissions, 22%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
290
Total Downloads

Downloads (Last 12 months)36
Downloads (Last 6 weeks)5

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Desmet VVandierendonck HDe Bosschere K(2007)Clustered indexing for branch predictorsMicroprocessors & Microsystems10.1016/j.micpro.2006.08.00331:3(168-177)Online publication date: 1-May-2007
https://dl.acm.org/doi/10.1016/j.micpro.2006.08.003
Jiménez DSarkar VHall M(2005)Code placement for improving dynamic branch prediction accuracyProceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation10.1145/1065010.1065025(107-116)Online publication date: 12-Jun-2005
https://dl.acm.org/doi/10.1145/1065010.1065025
Jiménez D(2005)Code placement for improving dynamic branch prediction accuracyACM SIGPLAN Notices10.1145/1064978.106502540:6(107-116)Online publication date: 12-Jun-2005
https://dl.acm.org/doi/10.1145/1064978.1065025

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

The effects of predicated execution on branch prediction

Speculative execution and branch prediction on parallel machines

Characterizing the impact of predicated execution on branch prediction