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
Parents
13
Programming with transactional coherence and consistency (TCC)
Lance Hammond, Brian D. Carlstrom, Vicky Wong et al. · 2004 · 150 citations
Design Rule Hierarchies and Parallelism in Software Development Tasks
Sunny Wong, Yuanfang Cai, Giuseppe Valetto et al. · 2009 · 73 citations
Janghaeng Lee, Mehrzad Samadi, Yongjun Park et al. · ACM Transactions on Computer Systems · 2015 · 46 citations
1–5 of 13
41
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 41
22
University of Chicago
Chicago, United States
3 h-index
9 publications
148 citations
Rochester Institute of Technology
Rochester, United States
2 h-index
2 publications
33 citations
Stanford University
Stanford, United States
2 h-index
14 publications
1.1K citations
Alcatel Lucent (Germany)
Stuttgart, Germany
1 h-index
1 publications
151 citations
Motorola (United States)
Schaumburg, United States
1 h-index
1 publications
151 citations

Motorola (South Korea)
Seoul, South Korea
1 h-index
1 publications
151 citations
Max Planck Society
Munich, Germany
1 h-index
1 publications
10 citations
University of Illinois Urbana-Champaign
Urbana, United States
1 h-index
3 publications
81 citations
1–8 of 22
1 publications · 27 citations
1
h-index
1 publications · 45 citations
1
h-index
1 publications · 10 citations
1
h-index
TOSEM · 1 publications · 151 citations
1
h-index
1 publications · 30 citations
1
h-index
1–5