The Community for Technology Leaders
Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques (2005)
St. Louis, Missouri
Sept. 17, 2005 to Sept. 21, 2005
ISSN: 1089-795X
ISBN: 0-7695-2429-X
pp: 75-86
Thomas F. Wenisch , Computer Architecture Laboratory (CALCM)
Stephen Somogyi , Computer Architecture Laboratory (CALCM)
Nikolaos Hardavellas , Computer Architecture Laboratory (CALCM)
Jangwoo Kim , Computer Architecture Laboratory (CALCM)
Chris Gniady , Computer Science Dept. University of Arizona
Anastassia Ailamaki , Computer Architecture Laboratory (CALCM) Carnegie Mellon University
Babak Falsafi , Computer Architecture Laboratory (CALCM) Carnegie Mellon University
ABSTRACT
<p>Coherence misses in shared-memory multiprocessors account for a substantial fraction of execution time in many important scientific and commercial workloads. Memory streaming provides a promising solution to the coherence miss bottleneck because it improves memory level parallelism and lookahead while using on-chip resources efficiently.</p> <p>We observe that the order in which shared data are consumed by one processor is correlated to the order in which they were produced by another. We investigate this phenomenon and demonstrate that it can be exploited to send Store-ORDered Streams (SORDS) of shared data from producers to consumers, thereby eliminating coherent read misses. Using a trace-driven analysis of all user and OS memory references in a cache-coherent distributed shared-memory multiprocessor, we show that SORDS based memory streaming can eliminate between 36% and 100% of all coherent read misses in scientific workloads and between 23% and 48%in online transaction processing workloads.</p>
INDEX TERMS
null
CITATION
Thomas F. Wenisch, Stephen Somogyi, Nikolaos Hardavellas, Jangwoo Kim, Chris Gniady, Anastassia Ailamaki, Babak Falsafi, "Store-Ordered Streaming of Shared Memory", Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques, vol. 00, no. , pp. 75-86, 2005, doi:10.1109/PACT.2005.37
80 ms
(Ver 3.3 (11022016))