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!

Be the first to leave a comment!