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
Parents
86
3.5-D Blocking Optimization for Stencil Computations on Modern CPUs and GPUs
Anthony D. Nguyen, Nadathur Satish, Jatin Chhugani et al. · 2010 · 293 citations
1–5 of 86
192
IBM Research - Thomas J. Watson Research Center, United States
5 publications · 249 citations
5
h-index
5
h-index
4
h-index
4
h-index
4
h-index
1–5 of 192
84

Umeå University
Umeå, Sweden
6 h-index
11 publications
1.1K citations
The University of Texas at Austin
Austin, United States
5 h-index
10 publications
367 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
5 h-index
8 publications
319 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
4 h-index
7 publications
237 citations

Australian National University
Canberra, Australia
3 h-index
4 publications
461 citations
University of Tennessee at Knoxville
Knoxville, United States
3 h-index
5 publications
231 citations
Institut de Recherche en Informatique et Systèmes Aléatoires
Rennes, France
3 h-index
6 publications
216 citations

Universitat Jaume I
Castellon, Spain
3 h-index
5 publications
214 citations
1–8 of 84
TOMS · 5 publications · 289 citations
5
h-index
5 publications · 341 citations
5
h-index
3 publications · 102 citations
3
h-index
2 publications · 42 citations
2
h-index
Repository · 2 publications · 407 citations
2
h-index
1–5