Memory Hierarchy Algorithms

Memory Hierarchy Algorithms is a class of algorithms designed to optimize data movement across different levels of a computer's memory hierarchy by explicitly managing data placement and access patterns to minimize latency and maximize throughput.

249

Publications

13.7K

Citations

582

Authors

248

Institutions

Publications per year

2017–2026

23

Authors

582

  1. JD
    James Demmel

    University of California, Berkeley, United States

    6 publications · 952 citations

    6

    h-index

  2. JS
    Jeffrey Scott Vitter

    Duke University, United States

    5 publications · 721 citations

    5

    h-index

  3. JD
    Jeremy D. Frens

    Indiana University Bloomington, United States

    4 publications · 215 citations

    4

    h-index

  4. JI
    J. Ian Munro

    University of Waterloo, Canada

    4 publications · 124 citations

    4

    h-index

  5. DM
    Dinesh Manocha

    University of North Carolina at Chapel Hill, United States

    4 publications · 260 citations

    4

    h-index

1–5 of 582

Venues

  1. IEEE Transactions on Computers

    8 publications · 406 citations

    8

    h-index

  2. ACM Transactions on Mathematical Software

    TOMS · 7 publications · 1.1K citations

    7

    h-index

  3. Algorithmica

    6 publications · 716 citations

    6

    h-index

  4. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 4 publications · 71 citations

    4

    h-index

  5. Choice Reviews Online

    CRO · 4 publications · 591 citations

    4

    h-index

1–5