Stride-based speculative cache access

Luis Villa, Oscar Camacho, Alejandro Villar, Cesar Osuna, Gustavo Santana, Manuel Romero

Producción científica: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

Resumen

Serialized cache access has been a strategy proposed in others' works to reduce the latency penalty introduced in a two-way set-associative cache. In this paper we present a novel mechanism, which provides a better or the same miss rate as a two-way set-associative cache, and with similar access time as a direct mapped cache. We use an address prediction strategy to select the correct cache set-entry in a virtually partitioned direct mapped cache.

Idioma originalInglés
Título de la publicación alojadaProceedings of the IASTED International Conference on Computer Science and Technology
EditoresS. Sahni
Páginas164-169
Número de páginas6
EstadoPublicada - 2003
EventoProceedings of the IASTED International Conference on Computer Science and Technology - Cancun, México
Duración: 19 may. 200321 may. 2003

Serie de la publicación

NombreProceedings of the IASTED International Conference on Computer Science and Technology

Conferencia

ConferenciaProceedings of the IASTED International Conference on Computer Science and Technology
País/TerritorioMéxico
CiudadCancun
Período19/05/0321/05/03

Huella

Profundice en los temas de investigación de 'Stride-based speculative cache access'. En conjunto forman una huella única.

Citar esto