Bandwidth-aware Scheduling
Bandwidth-Aware Scheduling is a memory hierarchy optimization technique that allocates and orders memory accesses according to available bandwidth resources to maximize data throughput and minimize latency in memory-intensive computing workloads.
112
Publications
4.4K
Citations
323
Authors
160
Institutions
Publications per year
2017–2026
22
112
Self-Optimizing Memory Controllers: A Reinforcement Learning Approach
Engin İpek, Onur Mutlu, José F. Martínez et al. · 2008 · 279 citations
Prashant Shenoy, Harrick M. Vin · 1998 · 212 citations
Yeon-sup Lim, Erich Nahum, Don Towsley et al. · 2017 · 149 citations
1–5 of 112
323
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 323
160
The University of Texas at Austin
Austin, United States
4 h-index
7 publications
805 citations

University of Waterloo
Waterloo, Canada
4 h-index
8 publications
276 citations

Huazhong University of Science and Technology
Wuhan, China
4 h-index
15 publications
600 citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
3 h-index
5 publications
166 citations
North Carolina State University
Raleigh, United States
3 h-index
4 publications
253 citations
Carnegie Mellon University
Pittsburgh, United States
3 h-index
8 publications
350 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
9 publications
818 citations

Universidade Estadual de Campinas (UNICAMP)
Campinas, Brazil
3 h-index
8 publications
146 citations
1–8 of 160
TNSM · 3 publications · 81 citations
3
h-index
Repository · 3 publications · 44 citations
3
h-index
TPDS · 3 publications · 229 citations
3
h-index
TON · 2 publications · 89 citations
2
h-index
2 publications · 73 citations
2
h-index
1–5