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

Authors

1.3K

  1. JD
    James Demmel

    University of California, Berkeley, United States

    19 publications · 1.3K citations

    17

    h-index

  2. JD
    Jack Dongarra

    University of Tennessee at Knoxville, United States

    17 publications · 1.4K citations

    15

    h-index

  3. OS
    Oded Schwartz

    University of California, Berkeley, United States

    13 publications · 660 citations

    13

    h-index

  4. GB
    Grey Ballard

    University of California, Berkeley, United States

    12 publications · 586 citations

    12

    h-index

  5. AL
    Alexey Lastovetsky

    University College Dublin, Ireland

    10 publications · 222 citations

    10

    h-index

1–5 of 1.3K

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 24 publications · 1.4K citations

    18

    h-index

  2. Parallel Computing

    16 publications · 630 citations

    13

    h-index

  3. IEEE Transactions on Computers

    13 publications · 744 citations

    12

    h-index

  4. arXiv (Cornell University)

    Repository · 9 publications · 253 citations

    9

    h-index

  5. ACM Transactions on Mathematical Software

    TOMS · 7 publications · 572 citations

    7

    h-index

1–5