Parallel Algorithms

A parallel algorithm is an algorithm that solves a computational problem by decomposing it into independent or loosely dependent subtasks capable of concurrent execution on multiple processors.

21.9K

Publications

1.2M

Citations

37.4K

Authors

4.7K

Institutions

Publications per year

2017–2026

3.3K

Authors

37.4K

  1. JD
    Jack Dongarra

    University of Tennessee at Knoxville, United States

    156 publications · 11.2K citations

    48

    h-index

  2. JD
    James Demmel

    University of California, Berkeley, United States

    73 publications · 7.8K citations

    43

    h-index

  3. GE
    Guy E. Blelloch

    Carnegie Mellon University, United States

    82 publications · 6.2K citations

    41

    h-index

  4. GK
    George Karypis

    University of Minnesota, United States

    51 publications · 13.4K citations

    35

    h-index

  5. PS
    P. Sadayappan

    The Ohio State University, United States

    69 publications · 3.2K citations

    32

    h-index

1–5 of 37.4K

Venues

  1. IEEE Transactions on Computers

    313 publications · 24.2K citations

    77

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 424 publications · 21.6K citations

    72

    h-index

  3. SIAM Journal on Scientific Computing

    297 publications · 24.7K citations

    72

    h-index

  4. Parallel Computing

    589 publications · 26.1K citations

    70

    h-index

  5. Journal of Parallel and Distributed Computing

    406 publications · 17.4K citations

    63

    h-index

1–5

See also

Parallel Algorithms

Core Models

Complexity Measures

Algorithmic Patterns

Synchronization Techniques

Application Domains