Identificador persistente para citar o vincular este elemento: http://hdl.handle.net/10553/50507
Título: Latency tolerant branch predictors
Autores/as: Santana, Oliverio J. 
Ramirez, Alex
Valero, Mateo
Clasificación UNESCO: 330406 Arquitectura de ordenadores
Fecha de publicación: 2003
Resumen: 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
Fuente: Proceedings of the Innovative Architecture for Future Generation High-Performance Processors and Systems [ISSN 1537-3223], v. 2003-January (1262780), p. 30-39
Colección:Actas de congresos
Vista completa

Google ScholarTM

Verifica

Altmetric


Comparte



Exporta metadatos



Los elementos en ULPGC accedaCRIS están protegidos por derechos de autor con todos los derechos reservados, a menos que se indique lo contrario.