Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/50507
Title: Latency tolerant branch predictors
Authors: Santana, Oliverio J. 
Ramirez, Alex
Valero, Mateo
UNESCO Clasification: 330406 Arquitectura de ordenadores
Issue Date: 2003
Abstract: The access latency of branch predictors is a well known problem of fetch engine design. Prediction overriding techniques are commonly accepted to overcome this problem. However, prediction overriding requires a complex recovery mechanism to discard the wrong speculative work based on overridden predictions. In this paper, we show that stream and trace predictors, which use long basic prediction units, can tolerate access latency without needing overriding, thus reducing fetch engine complexity. We show that both the stream fetch engine and the trace cache architecture not using overriding outperform other efficient fetch engines, such as an EV8-like fetch architecture or the FTB fetch engine, even when they do use overriding.
URI: http://hdl.handle.net/10553/50507
ISBN: 0-7695-2019-7
ISSN: 1537-3223
DOI: 10.1109/IWIA.2003.1262780
Source: Proceedings of the Innovative Architecture for Future Generation High-Performance Processors and Systems [ISSN 1537-3223], v. 2003-January (1262780), p. 30-39
Appears in Collections:Actas de congresos
Show full item record

SCOPUSTM   
Citations

6
checked on Jul 5, 2020

WEB OF SCIENCETM
Citations

3
checked on Jul 5, 2020

Page view(s)

13
checked on Jul 4, 2020

Google ScholarTM

Check

Altmetric


Share



Export metadata



Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.