loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2005 International Conference on Computer Design
Memory Bank Predictors
San Jose, California
October 02-October 05
ISBN: 0-7695-2451-6
Stefan Bieschewski, Departament d?Arquitectura de Computadors, Universitat Polit?cnica de Catalunya, Barcelona, Spain
Joan-Manuel Parcerisa, Departament d?Arquitectura de Computadors, Universitat Polit?cnica de Catalunya, Barcelona, Spain
Antonio Gonz?lez, Intel Barcelona Research Center, Intel Labs, Universitat Polit?cnica de Catalunya Barcelona, Spain

Cache memories are commonly implemented through multiple memory banks to improve bandwidth and latency. The early knowledge of the data cache bank that an instruction will access can help to improve the performance in several ways. One scenario that is likely to become increasingly important is clustered microprocessors with a distributed cache. This work presents a study of different cache bank predictors. We show that effective bank predictors can be implemented with relatively low cost. For instance, a predictor of approximately 4 Kbytes is shown to achieve an average hit rate of 78% for SPECint2000 when used to predict accesses to an 8-bank cache memory in a contemporary superscalar processor. We also show how a predictor can be used to reduce the communication latency caused by memory accesses in a clustered microarchitecture with a distributed cache design.

Citation:
Stefan Bieschewski, Joan-Manuel Parcerisa, Antonio Gonz?lez, "Memory Bank Predictors," iccd, pp.666-670, 2005 International Conference on Computer Design, 2005
Usage of this product signifies your acceptance of the Terms of Use.