Memory Traffic Reduction
Memory Traffic Reduction is a memory hierarchy optimization technique that minimizes data movement between memory levels by exploiting spatial and temporal locality, prefetching, or compression to decrease the volume of memory accesses required by a computing system.
202
Publications
9.8K
Citations
586
Authors
181
Institutions
Publications per year
2017–2026
40
202
Training Deep Nets with Sublinear Memory Cost
Tianqi Chen, Bing Xu, Chiyuan Zhang et al. · arXiv (Cornell University) · 2016 · 540 citations · Full text
Using cache memory to reduce processor-memory traffic
James Goodman · 1998 · 396 citations
Memory bandwidth limitations of future microprocessors
Doug Burger, James Goodman, Alain Kägi · 1996 · 394 citations · Full text
HarDNet: A Low Memory Traffic Network
Ping Chao, Chao-Yang Kao, Yu-Shan Ruan et al. · 2019 · 328 citations
Data Cache Prefetching Using a Global History Buffer
Kyle J. Nesbit, James E. Smith · 2005 · 307 citations
1–5 of 202
586
7
h-index
6
h-index
5
h-index
5
h-index
4
h-index
1–5 of 586
181
University of Wisconsin–Madison
Madison, United States
12 h-index
28 publications
3.4K citations
University of Michigan
Ann Arbor, United States
10 h-index
15 publications
1K citations
University of Illinois Urbana-Champaign
Urbana, United States
8 h-index
14 publications
858 citations
Intel (United States)
Santa Clara, United States
8 h-index
11 publications
535 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
8 h-index
24 publications
713 citations
National Tsing Hua University
Hsinchu, Taiwan
6 h-index
19 publications
2K citations
Seoul National University
Seoul, South Korea
5 h-index
11 publications
183 citations
The University of Texas at Austin
Austin, United States
5 h-index
8 publications
659 citations
1–8 of 181
9 publications · 392 citations
9
h-index
5 publications · 144 citations
5
h-index
5 publications · 110 citations
5
h-index
4 publications · 308 citations
4
h-index
3 publications · 42 citations
3
h-index
1–5