loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
33rd International Symposium on Computer Architecture (ISCA'06)
Spatial Memory Streaming
Boston, Massachusetts
June 17-June 21
ISBN: 0-7695-2608-X
Stephen Somogyi, Carnegie Mellon University
Thomas F. Wenisch, Carnegie Mellon University
Anastassia Ailamaki, Carnegie Mellon University
Babak Falsafi, Carnegie Mellon University
Andreas Moshovos, University of Toronto

Prior research indicates that there is much spatial variation in applications' memory access patterns. Modern memory systems, however, use small fixed-size cache blocks and as such cannot exploit the variation. Increasing the block size would not only prohibitively increase pin and interconnect bandwidth demands, but also increase the likelihood of false sharing in shared-memory multiprocessors.

In this paper, we show that memory accesses in commercial workloads often exhibit repetitive layouts that span large memory regions (e.g., several kB), and these accesses recur in patterns that are predictable through codebased correlation. We propose Spatial Memory Streaming, a practical on-chip hardware technique that identifies codecorrelated spatial access patterns and streams predicted blocks to the primary cache ahead of demand misses. Using cycle-accurate full-system multiprocessor simulation of commercial and scientific applications, we demonstrate that Spatial Memory Streaming can on average predict 58% of L1 and 65% of off-chip misses, for a mean performance improvement of 37% and at best 307%.

Citation:
Stephen Somogyi, Thomas F. Wenisch, Anastassia Ailamaki, Babak Falsafi, Andreas Moshovos, "Spatial Memory Streaming," isca, pp.252-263, 33rd International Symposium on Computer Architecture (ISCA'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.