Memory Access Scheduling
Memory Access Scheduling is a memory hierarchy optimization technique that determines the order in which pending memory requests are serviced by the memory controller to minimize access latency and maximize bandwidth utilization through strategic prioritization and reordering of requests.
113
Publications
6.7K
Citations
305
Authors
126
Institutions
Publications per year
2017–2026
21
113
Scott Rixner, William J. Dally, Ujval J. Kapasi et al. · 2000 · 966 citations · Full text
Self-Optimizing Memory Controllers
Engin İpek, Onur Mutlu, José F. Martínez et al. · ACM SIGARCH Computer Architecture News · 2008 · 371 citations
Stall-Time Fair Memory Access Scheduling for Chip Multiprocessors
2007 · 318 citations
Scott Rixner, William J. Dally, Ujval J. Kapasi et al. · ACM SIGARCH Computer Architecture News · 2000 · 166 citations · Full text
1–5 of 113
305
8
h-index
6
h-index
4
h-index
4
h-index
3
h-index
1–5 of 305
126
The University of Texas at Austin
Austin, United States
10 h-index
20 publications
1.4K citations
Intel (United States)
Santa Clara, United States
7 h-index
17 publications
1.9K citations
Carnegie Mellon University
Pittsburgh, United States
7 h-index
23 publications
2.3K citations

Pennsylvania State University
State College, United States
5 h-index
15 publications
770 citations
University of Illinois Chicago
Chicago, United States
4 h-index
6 publications
296 citations
Microsoft (United States)
Redmond, United States
4 h-index
7 publications
1.2K citations

University of Waterloo
Waterloo, Canada
3 h-index
7 publications
271 citations

Peking University
Beijing, China
3 h-index
8 publications
577 citations
1–8 of 126
5 publications · 587 citations
5
h-index
4 publications · 62 citations
4
h-index
TPDS · 4 publications · 131 citations
4
h-index
3 publications · 74 citations
3
h-index
2 publications · 186 citations
2
h-index
1–5