Task-parallel Algorithms

Task-Parallel Algorithms is a class of parallel algorithms that decompose a computational problem into distinct tasks, which are then executed concurrently across processing units, differing from data-parallel approaches by focusing on task-level rather than data-level concurrency.

63

Publications

3.8K

Citations

183

Authors

98

Institutions

Publications per year

2017–2026

14

Variants

Task-parallel Algorithm

Authors

183

  1. GL
    Greg Little

    Massachusetts Institute of Technology, United States

    4 publications · 756 citations

    4

    h-index

  2. VS
    Vivek Sarkar

    Rice University, United States

    3 publications · 54 citations

    3

    h-index

  3. MG
    Max Goldman

    Massachusetts Institute of Technology, United States

    3 publications · 724 citations

    3

    h-index

  4. ES
    Enrique S. Quintana–Ort́ı

    Universitat Jaume I, Spain

    3 publications · 42 citations

    3

    h-index

  5. LB
    Lydia B. Chilton

    Columbia University, United States

    3 publications · 724 citations

    3

    h-index

1–5 of 183

Venues

  1. Parallel Computing

    4 publications · 90 citations

    4

    h-index

  2. Journal of Parallel and Distributed Computing

    3 publications · 113 citations

    3

    h-index

  3. Parallel Processing Letters

    2 publications · 48 citations

    2

    h-index

  4. The Journal of Supercomputing

    2 publications · 180 citations

    2

    h-index

  5. 1

    h-index

1–5