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

Authors

305

  1. OM
    Onur Mutlu

    Carnegie Mellon University, United States

    8 publications · 975 citations

    8

    h-index

  2. ME
    Mattan Erez

    The University of Texas at Austin, United States

    6 publications · 469 citations

    6

    h-index

  3. ZZ
    Zhao Zhang

    Iowa State University, United States

    4 publications · 210 citations

    4

    h-index

  4. ZZ
    Zhichun Zhu

    University of Illinois Chicago, United States

    4 publications · 210 citations

    4

    h-index

  5. RP
    Rodolfo Pellizzoni

    University of Waterloo, Canada

    3 publications · 98 citations

    3

    h-index

1–5 of 305

Venues

  1. ACM SIGARCH Computer Architecture News

    5 publications · 587 citations

    5

    h-index

  2. 4

    h-index

  3. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 4 publications · 131 citations

    4

    h-index

  4. 3

    h-index

  5. Computer

    2 publications · 186 citations

    2

    h-index

1–5