Storage Access Latency Optimization
Storage Access Latency Optimization is a methodological framework within serverless computing that minimizes the time delay incurred during data retrieval operations by strategically orchestrating caching, data placement, and request routing mechanisms specific to ephemeral and event-driven execution environments.
115
Publications
6.4K
Citations
413
Authors
121
Institutions
Publications per year
2017–2026
26
115
Kien A. Hua, Simon Sheu · 1997 · 508 citations
John K. Ousterhout, Parag Agrawal, David Erickson et al. · ACM SIGOPS Operating Systems Review · 2010 · 451 citations
Alysson Bessani, Miguel Correia, Bruno Quaresma et al. · ACM Transactions on Storage · 2013 · 328 citations
Alysson Bessani, Miguel Correia, Bruno Quaresma et al. · 2011 · 328 citations
Addressing for Random-Access Storage
W. W. Peterson · IBM Journal of Research and Development · 1957 · 257 citations
1–5 of 115
413
4
h-index
4
h-index
4
h-index
4
h-index
4
h-index
1–5 of 413
121
AT&T (United States)
Bedminster, United States
6 h-index
12 publications
361 citations
The Ohio State University
Columbus, United States
5 h-index
24 publications
2.1K citations
University of California San Diego
San Diego, United States
5 h-index
21 publications
1.2K citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
4 h-index
9 publications
466 citations

Huazhong University of Science and Technology
Wuhan, China
4 h-index
19 publications
259 citations
Tsinghua University
Beijing, China
3 h-index
5 publications
180 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
15 publications
950 citations
IBM (United States)
Armonk, United States
3 h-index
6 publications
273 citations
1–8 of 121
3 publications · 65 citations
3
h-index
TON · 3 publications · 143 citations
3
h-index
TOS · 3 publications · 420 citations
3
h-index
2 publications · 120 citations
2
h-index
2 publications · 270 citations
2
h-index
1–5