Parallel Sparse Linear Algebra
Parallel Sparse Linear Algebra is a computational framework that enables the distributed execution of linear algebra operations on sparse matrices through parallel processing techniques, distinguishing itself by optimizing scalability and efficiency in high-performance computing environments.
780
Publications
40.9K
Citations
1.5K
Authors
457
Institutions
Publications per year
2017–2026
110
Parents
780
George Karypis, Vipin Kumar · University of Minnesota Digital Conservancy (University of Minnesota) · 1997 · 1.2K citations · Full text
Benchmarking GPUs to tune dense linear algebra
В. М. Волков, James Demmel · 2008 · 726 citations
1–5 of 780
1.5K
21
h-index
18
h-index
14
h-index
13
h-index
12
h-index
1–5 of 1.5K
457
University of Tennessee at Knoxville
Knoxville, United States
22 h-index
87 publications
6K citations

Oak Ridge National Laboratory
Oak Ridge, United States
19 h-index
43 publications
3K citations
University of Illinois Urbana-Champaign
Urbana, United States
19 h-index
57 publications
2.4K citations
University of California, Berkeley
Berkeley, United States
19 h-index
35 publications
5.8K citations
The University of Texas at Austin
Austin, United States
18 h-index
54 publications
4.3K citations

Lawrence Berkeley National Laboratory
Berkeley, United States
16 h-index
33 publications
1.8K citations

Rutherford Appleton Laboratory
Didcot, United Kingdom
15 h-index
27 publications
1.2K citations

University of Manchester
Manchester, United Kingdom
15 h-index
17 publications
800 citations
1–8 of 457
34 publications · 3.3K citations
28
h-index
76 publications · 3K citations
28
h-index
TOMS · 30 publications · 2.2K citations
22
h-index
19 publications · 1.5K citations
15
h-index
Repository · 14 publications · 398 citations
11
h-index
1–5