Temporal streaming of shared memory

Thomas F. Wenisch*, Stephen Somogyi, Nikolaos Hardavellas, Jangwoo Kim, Anastassia Ailamaki, Babak Falsafi

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

88 Citations (Scopus)

Abstract

Coherent read misses in shared-memory multiprocessors account for a substantial fraction of execution time in many important scientific and commercial workloads. We propose Temporal Streaming, to eliminate coherent read misses by streaming data to a processor in advance of the corresponding memory accesses. Temporal streaming dynamically identifies address sequences to be streamed by exploiting two common phenomena in shared-memory access patterns: (1) temporal address correlation - groups of shared addresses tend to be accessed together and in the same order, and (2) temporal stream locality - recently-accessed address streams are likely to recur. We present a practical design for temporal streaming. We evaluate our design using a combination of trace-driven and cycle-accurate full-system simulation of a cache-coherent distributed shared-memory system. We show that temporal streaming can eliminate 98% of coherent read misses in scientific applications, and between 43% and 60% in database and web server workloads. Our design yields speedups of 1.07 to 3.29 in scientific applications, and 1.06 to 1.21 in commercial workloads.

Original languageEnglish (US)
Title of host publicationProceedings - 32nd International Symposium on Computer Architecture, ISCA 2005
Pages222-233
Number of pages12
DOIs
StatePublished - Nov 10 2005
Event32nd Interntional Symposium on Computer Architecture, ISCA 2005 - Madison, WI, United States
Duration: Jun 4 2005Jun 8 2005

Publication series

NameProceedings - International Symposium on Computer Architecture
ISSN (Print)1063-6897

Other

Other32nd Interntional Symposium on Computer Architecture, ISCA 2005
CountryUnited States
CityMadison, WI
Period6/4/056/8/05

Fingerprint

Data storage equipment
Servers

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Wenisch, T. F., Somogyi, S., Hardavellas, N., Kim, J., Ailamaki, A., & Falsafi, B. (2005). Temporal streaming of shared memory. In Proceedings - 32nd International Symposium on Computer Architecture, ISCA 2005 (pp. 222-233). (Proceedings - International Symposium on Computer Architecture). https://doi.org/10.1109/ISCA.2005.50
Wenisch, Thomas F. ; Somogyi, Stephen ; Hardavellas, Nikolaos ; Kim, Jangwoo ; Ailamaki, Anastassia ; Falsafi, Babak. / Temporal streaming of shared memory. Proceedings - 32nd International Symposium on Computer Architecture, ISCA 2005. 2005. pp. 222-233 (Proceedings - International Symposium on Computer Architecture).
@inproceedings{eddc2decd52b4f84902a2ba81ae41af0,
title = "Temporal streaming of shared memory",
abstract = "Coherent read misses in shared-memory multiprocessors account for a substantial fraction of execution time in many important scientific and commercial workloads. We propose Temporal Streaming, to eliminate coherent read misses by streaming data to a processor in advance of the corresponding memory accesses. Temporal streaming dynamically identifies address sequences to be streamed by exploiting two common phenomena in shared-memory access patterns: (1) temporal address correlation - groups of shared addresses tend to be accessed together and in the same order, and (2) temporal stream locality - recently-accessed address streams are likely to recur. We present a practical design for temporal streaming. We evaluate our design using a combination of trace-driven and cycle-accurate full-system simulation of a cache-coherent distributed shared-memory system. We show that temporal streaming can eliminate 98{\%} of coherent read misses in scientific applications, and between 43{\%} and 60{\%} in database and web server workloads. Our design yields speedups of 1.07 to 3.29 in scientific applications, and 1.06 to 1.21 in commercial workloads.",
author = "Wenisch, {Thomas F.} and Stephen Somogyi and Nikolaos Hardavellas and Jangwoo Kim and Anastassia Ailamaki and Babak Falsafi",
year = "2005",
month = "11",
day = "10",
doi = "10.1109/ISCA.2005.50",
language = "English (US)",
isbn = "076952270X",
series = "Proceedings - International Symposium on Computer Architecture",
pages = "222--233",
booktitle = "Proceedings - 32nd International Symposium on Computer Architecture, ISCA 2005",

}

Wenisch, TF, Somogyi, S, Hardavellas, N, Kim, J, Ailamaki, A & Falsafi, B 2005, Temporal streaming of shared memory. in Proceedings - 32nd International Symposium on Computer Architecture, ISCA 2005. Proceedings - International Symposium on Computer Architecture, pp. 222-233, 32nd Interntional Symposium on Computer Architecture, ISCA 2005, Madison, WI, United States, 6/4/05. https://doi.org/10.1109/ISCA.2005.50

Temporal streaming of shared memory. / Wenisch, Thomas F.; Somogyi, Stephen; Hardavellas, Nikolaos; Kim, Jangwoo; Ailamaki, Anastassia; Falsafi, Babak.

Proceedings - 32nd International Symposium on Computer Architecture, ISCA 2005. 2005. p. 222-233 (Proceedings - International Symposium on Computer Architecture).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Temporal streaming of shared memory

AU - Wenisch, Thomas F.

AU - Somogyi, Stephen

AU - Hardavellas, Nikolaos

AU - Kim, Jangwoo

AU - Ailamaki, Anastassia

AU - Falsafi, Babak

PY - 2005/11/10

Y1 - 2005/11/10

N2 - Coherent read misses in shared-memory multiprocessors account for a substantial fraction of execution time in many important scientific and commercial workloads. We propose Temporal Streaming, to eliminate coherent read misses by streaming data to a processor in advance of the corresponding memory accesses. Temporal streaming dynamically identifies address sequences to be streamed by exploiting two common phenomena in shared-memory access patterns: (1) temporal address correlation - groups of shared addresses tend to be accessed together and in the same order, and (2) temporal stream locality - recently-accessed address streams are likely to recur. We present a practical design for temporal streaming. We evaluate our design using a combination of trace-driven and cycle-accurate full-system simulation of a cache-coherent distributed shared-memory system. We show that temporal streaming can eliminate 98% of coherent read misses in scientific applications, and between 43% and 60% in database and web server workloads. Our design yields speedups of 1.07 to 3.29 in scientific applications, and 1.06 to 1.21 in commercial workloads.

AB - Coherent read misses in shared-memory multiprocessors account for a substantial fraction of execution time in many important scientific and commercial workloads. We propose Temporal Streaming, to eliminate coherent read misses by streaming data to a processor in advance of the corresponding memory accesses. Temporal streaming dynamically identifies address sequences to be streamed by exploiting two common phenomena in shared-memory access patterns: (1) temporal address correlation - groups of shared addresses tend to be accessed together and in the same order, and (2) temporal stream locality - recently-accessed address streams are likely to recur. We present a practical design for temporal streaming. We evaluate our design using a combination of trace-driven and cycle-accurate full-system simulation of a cache-coherent distributed shared-memory system. We show that temporal streaming can eliminate 98% of coherent read misses in scientific applications, and between 43% and 60% in database and web server workloads. Our design yields speedups of 1.07 to 3.29 in scientific applications, and 1.06 to 1.21 in commercial workloads.

UR - http://www.scopus.com/inward/record.url?scp=27544508955&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=27544508955&partnerID=8YFLogxK

U2 - 10.1109/ISCA.2005.50

DO - 10.1109/ISCA.2005.50

M3 - Conference contribution

AN - SCOPUS:27544508955

SN - 076952270X

T3 - Proceedings - International Symposium on Computer Architecture

SP - 222

EP - 233

BT - Proceedings - 32nd International Symposium on Computer Architecture, ISCA 2005

ER -

Wenisch TF, Somogyi S, Hardavellas N, Kim J, Ailamaki A, Falsafi B. Temporal streaming of shared memory. In Proceedings - 32nd International Symposium on Computer Architecture, ISCA 2005. 2005. p. 222-233. (Proceedings - International Symposium on Computer Architecture). https://doi.org/10.1109/ISCA.2005.50