Parallel Matrix Multiplication
Parallel Matrix Multiplication is a computational method that decomposes matrix multiplication operations into concurrent subtasks coordinated across multiple processing units under shared-memory or data-parallel architectures to accelerate execution while maintaining numerical correctness.
524
Publications
27K
Citations
1.3K
Authors
427
Institutions
Publications per year
2017–2026
75
524
1–5 of 524
1.3K
17
h-index
15
h-index
13
h-index
12
h-index
10
h-index
1–5 of 1.3K
427
University of California, Berkeley
Berkeley, United States
18 h-index
89 publications
4.4K citations
The University of Texas at Austin
Austin, United States
12 h-index
27 publications
2.6K citations
Stanford University
Stanford, United States
12 h-index
21 publications
1.6K citations
University of Illinois Urbana-Champaign
Urbana, United States
11 h-index
17 publications
348 citations
University of Tennessee at Knoxville
Knoxville, United States
11 h-index
26 publications
2.6K citations
University College Dublin
Dublin, Ireland
10 h-index
23 publications
484 citations
The Ohio State University
Columbus, United States
10 h-index
28 publications
827 citations

Oak Ridge National Laboratory
Oak Ridge, United States
10 h-index
24 publications
816 citations
1–8 of 427
TPDS · 24 publications · 1.4K citations
18
h-index
16 publications · 630 citations
13
h-index
13 publications · 744 citations
12
h-index
Repository · 9 publications · 253 citations
9
h-index
TOMS · 7 publications · 572 citations
7
h-index
1–5