Analysis of the O-GEometric History Length Branch Predictor

In this paper, we introduce and analyze the Optimized GEometric History Length (O-GEHL) branch Predictor that efficiently exploits very long global histories in the100-200 bits range. The GEHL predictor features several predictor tables T(i) (e.g. 8) indexed through independent functions of the glob...

Full description

Saved in:
Bibliographic Details
Published in:32nd International Symposium on Computer Architecture (ISCA'05) pp. 394 - 405
Main Author: Seznec, Andre
Format: Conference Proceeding
Language:English
Published: Washington, DC, USA IEEE Computer Society 01.05.2005
IEEE
Series:ACM Conferences
Subjects:
Accuracy
Application software
Best practices
Computer architecture
Computer systems organization > Architectures > Other architectures > Neural networks
Counting circuits
Fitting
Hardware > Electronic design automation > High-level and register-transfer level synthesis > Datapath optimization
Hardware > Electronic design automation > Logic synthesis > Circuit optimization
Hardware > Hardware validation > Functional verification > Simulation and emulation
Hardware > Very large scale integration design > Application-specific VLSI designs > Application specific processors
History
Mathematics of computing > Discrete mathematics > Graph theory > Paths and connectivity problems
Performance gain
Pipelines
Space exploration
ISBN:076952270X, 9780769522708
ISSN:1063-6897
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract In this paper, we introduce and analyze the Optimized GEometric History Length (O-GEHL) branch Predictor that efficiently exploits very long global histories in the100-200 bits range. The GEHL predictor features several predictor tables T(i) (e.g. 8) indexed through independent functions of the global branch history and branch address. The set of used global history lengths forms a geometric series, i.e., L(j) = \alpha ^{i - 1} L(1).This allows the GEHL predictor to efficiently capture correlation on recent branch outcomes as well as on very old branches. As on perceptron predictors, the prediction is computed through the addition of the predictions read on the predictor tables. The O-GEHL predictor further improves the ability of the GEHL predictor to exploit very long histories through the addition of dynamic history fitting and dynamic threshold fitting. The O-GEHL predictor can be ahead pipelined to provide in time predictions on every cycle.
AbstractList In this paper, we introduce and analyze the Optimized GEometric History Length (O-GEHL) branch Predictor that efficiently exploits very long global histories in the100-200 bits range. The GEHL predictor features several predictor tables T(i) (e.g. 8) indexed through independent functions of the global branch history and branch address. The set of used global history lengths forms a geometric series, i.e., L(j) = alpha {i - 1} L(1).This allows the GEHL predictor to efficiently capture correlation on recent branch outcomes as well as on very old branches. As on perceptron predictors, the prediction is computed through the addition of the predictions read on the predictor tables. The O-GEHL predictor further improves the ability of the GEHL predictor to exploit very long histories through the addition of dynamic history fitting and dynamic threshold fitting. The O-GEHL predictor can be ahead pipelined to provide in time predictions on every cycle.
In this paper, we introduce and analyze the Optimized GEometric History Length (O-GEHL) branch Predictor that efficiently exploits very long global histories in the 100-200 bits range. The GEHL predictor features several predictor tables T(i) (e.g. 8) indexed through independent functions of the global branch history and branch address. The set of used global history lengths forms a geometric series, i.e., L(j) = /spl alpha//sup j-1/L(1). This allows the GEHL predictor to efficiently capture correlation on recent branch outcomes as well as on very old branches. As on perceptron predictors, the prediction is computed through the addition of the predictions read on the predictor tables. The O-GEHL predictor further improves the ability of the GEHL predictor to exploit very long histories through the addition of dynamic history fitting and dynamic threshold fitting. The O-GEHL predictor can be ahead pipelined to provide in time predictions on every cycle.
Author Seznec, Andre
Author_xml – sequence: 1
  givenname: Andre
  surname: Seznec
  fullname: Seznec, Andre
  organization: IRISA/INRIA/HIPEAC
BookMark eNqNkLFOwzAQQC1RJErpxsaSBRbUYp9juxFTqUpbqVKRAInNcpwLNSRxsdOhf0-q8gHccDe8pxveJek1vkFCrhkdM0azh9XrbDoGSsWY8TNySZXMBICiHz3SZ1TykZxk6oIMY_yi3aSCAYM-eZw2pjpEFxNfJu0Wk81oMfc1tsHZZOli68MhWWPz2W6Tp2Aau01eAhbOduCKnJemijj8uwPy_jx_my1H681iNZuuRwYUtN0uuCjTHCRQMzEyB1XyNCuMzVEJq0AwAYVUlhXcqjy3YDIUKZRUKkkL4ANyd_q7C_5nj7HVtYsWq8o06PdRc8aVgknWiTcn0SGi3gVXm3DQLOVMKN7R-xM1tta5999RM6qP8fQxnj7G04zrPDgsO_v2Pzb_Bf0DbXA
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/ISCA.2005.13
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE/IET Electronic Library (IEL) (UW System Shared)
IEEE Proceedings Order Plans (POP) 1998-present
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library (IEL) (UW System Shared)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 405
ExternalDocumentID 1431573
Genre orig-research
Conference Paper
GroupedDBID 6IE
6IF
6IG
6IH
6IK
6IL
6IM
6IN
AAJGR
AARBI
ACM
ADPZR
ALMA_UNASSIGNED_HOLDINGS
APO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
GUFHI
IERZE
OCL
RIB
RIC
RIE
RIL
RIO
23M
29F
29O
AAWTH
ACGFS
ADZIZ
CHZPO
IEGSK
IJVOP
IPLJI
M43
ZY4
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-a272t-a2d35f4b2620a8a6b27f349dacbe75c725152d67c1d3c7bbc2a9e542f06760d23
IEDL.DBID RIE
ISBN 076952270X
9780769522708
ISICitedReferencesCount 47
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000230463000033&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1063-6897
IngestDate Thu Jul 10 17:28:03 EDT 2025
Wed Aug 27 02:17:14 EDT 2025
Wed Jan 31 06:47:37 EST 2024
Wed Jan 31 06:45:01 EST 2024
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MeetingName ISCA05: The 32nd Annual International Symposium on Computer Architecture 2005
MergedId FETCHMERGED-LOGICAL-a272t-a2d35f4b2620a8a6b27f349dacbe75c725152d67c1d3c7bbc2a9e542f06760d23
Notes SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
PQID 31377289
PQPubID 23500
PageCount 12
ParticipantIDs proquest_miscellaneous_31377289
acm_books_10_1109_ISCA_2005_13_brief
acm_books_10_1109_ISCA_2005_13
ieee_primary_1431573
PublicationCentury 2000
PublicationDate 20050501
20050000
20050604
PublicationDateYYYYMMDD 2005-05-01
2005-01-01
2005-06-04
PublicationDate_xml – month: 05
  year: 2005
  text: 20050501
  day: 01
PublicationDecade 2000
PublicationPlace Washington, DC, USA
PublicationPlace_xml – name: Washington, DC, USA
PublicationSeriesTitle ACM Conferences
PublicationTitle 32nd International Symposium on Computer Architecture (ISCA'05)
PublicationTitleAbbrev ISCA
PublicationYear 2005
Publisher IEEE Computer Society
IEEE
Publisher_xml – name: IEEE Computer Society
– name: IEEE
SSID ssj0000451212
ssj0019956
Score 1.860529
Snippet In this paper, we introduce and analyze the Optimized GEometric History Length (O-GEHL) branch Predictor that efficiently exploits very long global histories...
SourceID proquest
ieee
acm
SourceType Aggregation Database
Publisher
StartPage 394
SubjectTerms Accuracy
Application software
Best practices
Computer architecture
Computer systems organization -- Architectures -- Other architectures -- Neural networks
Counting circuits
Fitting
Hardware -- Electronic design automation -- High-level and register-transfer level synthesis -- Datapath optimization
Hardware -- Electronic design automation -- Logic synthesis -- Circuit optimization
Hardware -- Hardware validation -- Functional verification -- Simulation and emulation
Hardware -- Very large scale integration design -- Application-specific VLSI designs -- Application specific processors
History
Mathematics of computing -- Discrete mathematics -- Graph theory -- Paths and connectivity problems
Performance gain
Pipelines
Space exploration
Title Analysis of the O-GEometric History Length Branch Predictor
URI https://ieeexplore.ieee.org/document/1431573
https://www.proquest.com/docview/31377289
WOSCitedRecordID wos000230463000033&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB6sePBUtRXrcw89Gk02j83iSaQ-QGrBB96W3c0u7aFJ6UPw37uzbepBEbyEhCQQJpnMfDM73wfQtZbyUFETJHFCgyTKwyDnqQpMpFz-wZ1velKft0fW7-fv73ywAefrWRhjjF98Zi5w1_fyi0ovsFR26WJ7lLK4AQ3GsuWs1rqegjwp9Js6CieP_WSRC8FBliP9H0J27tINFtbMO_Vxvl4Rzy8fnm-ul6UWr3gg9Xilu_LjZ-0j0G3zf8--A-3vUT4yWAepXdgw5R40ay0HsnLtFlzV7CSkssQlheQpuOtVY9Tb0mRJSvxJUHVlPiQKxTiGZDLFJo870YbX297LzX2wElYIJGV07rZFnNpEIRm9zGWmKLNxwguplWGpZi7nSWmRMR0VsWZKaSq5SRNqXWjLwoLG-7BZVqU5ABIaGprISgebrHP_SLJEMa4LS6WSkQw7cOpMKBAxzIQHHCEXaGPUv0xFFHeg-_cFQk1HxnaghTYVkyUHh1iZswNn9UsRzi-w2SFLUy1mIkYqRYcmD3-_8Qi2PQmrL6Ycw-Z8ujAnsKU_5qPZ9NR_Wl8L8MNe
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1JS8QwFH7oKOhpXHFcc_BoNU3TSYMnETccR8EFbyFJE_TgVGYR_PfmZabjQRG8lJSmUF768ra87wPY955JaphLeMZZwtOCJoXMTeJSE_wPGXQzgvo8dUS3Wzw_y7sZOJj2wjjn4uEzd4jDWMsvKzvCVNlRsO1pLrJZmMs5Z3TcrTXNqCBSCvsGj8Le49hbFIxw0i4QABCDdhkcDkFr7J36vpieiZdHV_enJ-NkS-Q80PZtwrzyY7uONui8-b-vX4K172Y-cjc1U8sw43or0KzZHMhEuVfhuMYnIZUnwS0kt8nFWfWGjFuWjGGJPwnyrgxfiEE6jhfy3scyT3iwBo_nZw-nl8mEWiHRTLBhuJZZ7rlBOHpd6LZhwmdcltoaJ3IrgteTs7ItbFpmVhhjmZYu58wH49amJcvWodGrem4DCHWMutTrEDj5sAGkWnAjpC0900anmrZgN4hQYcwwUDHkoFKhjJEBM1dp1oL9vyco0391vgWrKFP1PkbhUBNxtmCvXhQVNAPLHbrnqtFAZQimGOLJzd9f3IOFy4ebjupcda-3YDFCssbUyjY0hv2R24F5-zF8HfR342_2BWh7xqU
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=32nd+International+Symposium+on+Computer+Architecture+%28ISCA%2705%29&rft.atitle=Analysis+of+the+O-GEometric+history+length+branch+predictor&rft.au=Seznec%2C+A.&rft.date=2005-01-01&rft.pub=IEEE&rft.isbn=9780769522708&rft.issn=1063-6897&rft.spage=394&rft.epage=405&rft_id=info:doi/10.1109%2FISCA.2005.13&rft.externalDocID=1431573
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6897&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6897&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6897&client=summon