Tile Size Optimization

Tile Size Optimization is a memory hierarchy optimization technique that determines the optimal granularity of data blocks, or tiles, to maximize data reuse and minimize memory access latency in nested loop computations.

82

Publications

4K

Citations

273

Authors

120

Institutions

Publications per year

2017–2026

21

Variants

Tiling Optimization

Authors

273

  1. SR
    Sanjay Rajopadhye

    Colorado State University, United States

    11 publications · 390 citations

    11

    h-index

  2. PS
    P. Sadayappan

    The Ohio State University, United States

    8 publications · 315 citations

    8

    h-index

  3. JR
    J. Ramanujam

    Louisiana State University, United States

    6 publications · 260 citations

    6

    h-index

  4. RA
    Rumen Andonov

    Institut de Recherche en Informatique et Systèmes Aléatoires, France

    5 publications · 110 citations

    5

    h-index

  5. LR
    Lakshminarayanan Renganarayanan

    Colorado State University, United States

    4 publications · 212 citations

    4

    h-index

1–5 of 273

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 3 publications · 142 citations

    3

    h-index

  2. ACM SIGPLAN Notices

    3 publications · 78 citations

    3

    h-index

  3. 2

    h-index

  4. Remote Sensing

    2 publications · 77 citations

    2

    h-index

  5. The Journal of Supercomputing

    2 publications · 72 citations

    2

    h-index

1–5