Blocked Algorithms

Blocked Algorithms is a computational strategy in numerical linear algebra that partitions large matrices into smaller blocks to optimize memory hierarchy usage and improve performance by distinguishing itself from unblocked methods through its exploitation of cache-friendly data access patterns.

86

Publications

6K

Citations

192

Authors

84

Institutions

Publications per year

2017–2026

6

Variants

Block Algorithms

Authors

192

  1. FG
    Fred G. Gustavson

    IBM Research - Thomas J. Watson Research Center, United States

    5 publications · 249 citations

    5

    h-index

  2. BK
    Bo Kågström

    Umeå University, Sweden

    5 publications · 446 citations

    5

    h-index

  3. ME
    Michael E. Wolf

    Stanford University, United States

    4 publications · 1.1K citations

    4

    h-index

  4. ER
    Edward Rothberg

    Stanford University, United States

    4 publications · 1.1K citations

    4

    h-index

  5. MD
    Monica D. Lam

    Stanford University, United States

    4 publications · 1.1K citations

    4

    h-index

1–5 of 192

Venues

  1. ACM Transactions on Mathematical Software

    TOMS · 5 publications · 289 citations

    5

    h-index

  2. SIAM Journal on Scientific Computing

    5 publications · 341 citations

    5

    h-index

  3. ACM SIGPLAN Notices

    3 publications · 102 citations

    3

    h-index

  4. Journal of Quality Technology

    2 publications · 42 citations

    2

    h-index

  5. ANU Open Research (Australian National University)

    Repository · 2 publications · 407 citations

    2

    h-index

1–5