ACM Home Page
Please provide us with feedback. Feedback
Spatio-temporal memory streaming
Full text PdfPdf (638 KB)
Source
International Symposium on Computer Architecture archive
Proceedings of the 36th annual international symposium on Computer architecture table of contents
Austin, TX, USA
SESSION: Prefetching and streaming table of contents
Pages 69-80  
Year of Publication: 2009
ISBN:978-1-60558-526-0
Also published in ...
Authors
Stephen Somogyi  Carnegie Mellon University, Pittsburgh, PA, USA
Thomas F. Wenisch  University of Michigan, Ann Arbor, MI, USA
Anastasia Ailamaki  Ecole Polytechnique Federale de Lausanne, Lausanne, Switzerland
Babak Falsafi  Ecole Polytechnique Federale de Lausanne, Lausanne, Switzerland
Sponsors
SIGARCH: ACM Special Interest Group on Computer Architecture
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 88,   Downloads (12 Months): 206,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1555754.1555766
What is a DOI?

ABSTRACT

Recent research advocates memory streaming techniques to alleviate the performance bottleneck caused by the high latencies of off-chip memory accesses. Temporal memory streaming replays previously observed miss sequences to eliminate long chains of dependent misses. Spatial memory streaming predicts repetitive data layout patterns within fixed-size memory regions. Because each technique targets a different subset of misses, their effectiveness varies across workloads and each leaves a significant fraction of misses unpredicted.

In this paper, we propose Spatio-Temporal Memory Streaming (STeMS) to exploit the synergy between spatial and temporal streaming. We observe that the order of spatial accesses repeats both within and across regions. STeMS records and replays the temporal sequence of region accesses and uses spatial relationships within each region to dynamically reconstruct a predicted total miss order. Using trace-driven and cycle-accurate simulation across a suite of commercial workloads, we demonstrate that with similar implementation complexity as temporal streaming, STeMS achieves equal or higher coverage than spatial or temporal memory streaming alone, and improves performance by 31%, 3%, and 18% over stride, spatial, and temporal prediction, respectively.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
3
 
4
5
 
6
7
 
8
 
9
Craig G. Nevill-Manning and Ian H. Witten. Identifying hierarchical structure in sequences: A linear-time algorithm. Journal of Artificial Intelligence Research, 7, 1997.
 
10
 
11
Nikos Hardavellas, Ippokratis Pandis, Ryan Johnson, Naju G. Mancheril, Anastassia Ailamaki, and Babak Falsafi. Database servers on chip multiprocessors: Limitations and opportunities. In Proceedings of the 3rd Conference on Innovative Data Systems Research, Jan. 2007.
 
12
13
14
15
16
 
17
 
18
19
20
21
 
22
23
 
24
Thomas F. Wenisch, Michael Ferdman, Anastasia Ailamaki, Babak Falsafi, and Andreas Moshovos. Temporal streams in commercial server applications. In Proceedings of the International Symposium on Workload Characterization, Sep. 2008.
 
25
Thomas F. Wenisch, Michael Ferdman, Anastasia Ailamaki, Babak Falsafi, and Andreas Moshovos. Practical off-chip meta-data for address-correlated prefetching. In Proceedings of the 15th Symposium on High-Performance Computer Architecture, Feb. 2009.
26
 
27
28
 
29
 
30


Collaborative Colleagues:
Stephen Somogyi: colleagues
Thomas F. Wenisch: colleagues
Anastasia Ailamaki: colleagues
Babak Falsafi: colleagues