Storage Access Patterns
Storage Access Patterns is a computational construct that characterizes the temporal and spatial behavior of data requests to storage systems, distinguished by the specific sequences, sizes, frequencies, and directionalities of read and write operations observed during input/output execution.
237
Publications
12.7K
Citations
783
Authors
227
Institutions
Publications per year
2017–2026
50
237
Chris Ruemmler, John Wilkes · 1993 · 397 citations
Sungjin Lee, Dongkun Shin, Young‐Jin Kim et al. · ACM SIGOPS Operating Systems Review · 2008 · 303 citations
iDedup: latency-aware, inline data deduplication for primary storage
Kiran Srinivasan, Tim Bisson, Garth R. Goodson et al. · 2012 · 254 citations
1–5 of 237
783
7
h-index
6
h-index
6
h-index
5
h-index
4
h-index
1–5 of 783
227
Argonne National Laboratory
Lemont, United States
11 h-index
34 publications
4K citations
University of California, Berkeley
Berkeley, United States
10 h-index
22 publications
1.8K citations

Oak Ridge National Laboratory
Oak Ridge, United States
9 h-index
37 publications
834 citations
Carnegie Mellon University
Pittsburgh, United States
9 h-index
43 publications
5.1K citations
University of California San Diego
San Diego, United States
6 h-index
27 publications
2.5K citations
IBM (United States)
Armonk, United States
6 h-index
10 publications
877 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
6 h-index
13 publications
500 citations
University of Illinois Urbana-Champaign
Urbana, United States
6 h-index
14 publications
695 citations
1–8 of 227
PVLDB · 5 publications · 180 citations
5
h-index
TOS · 5 publications · 337 citations
5
h-index
4 publications · 436 citations
4
h-index
TPDS · 4 publications · 74 citations
4
h-index
3 publications · 418 citations
3
h-index
1–5