|
Published Articles >> Table of Contents >> Abstract
33rd International Symposium on Computer Architecture (ISCA'06)
pp. 252-263
Spatial Memory Streaming
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
Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISCA.2006.38
Send link to a friend
| Abstract |
|
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%.
|
Additional Information
|
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
|
|