Parallel Work Decomposition

Parallel Work Decomposition is a computational strategy within thread programming that partitions a task into distinct, concurrently executable subtasks to exploit parallelism, differing from sequential decomposition by explicitly enabling simultaneous execution across multiple threads.

13

Publications

605

Citations

41

Authors

22

Institutions

Publications per year

2017–2026

3

Authors

41

  1. JR
    John Reppy

    University of Chicago, United States

    3 publications · 46 citations

    3

    h-index

  2. MR
    Mike Rainey

    University of Chicago, United States

    2 publications · 33 citations

    2

    h-index

  3. KO
    Kunle Olukotun

    Stanford University, United States

    2 publications · 160 citations

    2

    h-index

  4. MF
    Matthew Fluet

    University of Chicago, United States

    2 publications · 33 citations

    2

    h-index

  5. AS
    Adam Shaw

    University of Chicago, United States

    2 publications · 33 citations

    2

    h-index

1–5 of 41

Venues

  1. 1

    h-index

  2. IEEE Computer Graphics and Applications

    1 publications · 45 citations

    1

    h-index

  3. Journal of Functional Programming

    1 publications · 10 citations

    1

    h-index

  4. ACM Transactions on Software Engineering and Methodology

    TOSEM · 1 publications · 151 citations

    1

    h-index

  5. Automation in Construction

    1 publications · 30 citations

    1

    h-index

1–5