Partitioning Strategies for Concurrent Programming
This work presents four partitioning strategies, or design patterns, useful for decomposing a serial application into multiple concurrently executing parts. These partitioning strategies augment the commonly used task and data parallel design patterns by recognizing that applications are spatiotem...
Main Authors: | Hoffmann, Henry Christian, Agarwal, Anant, Devadas, Srinivas |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
2010
|
Online Access: | http://hdl.handle.net/1721.1/59845 https://orcid.org/0000-0001-8253-7714 https://orcid.org/0000-0002-7015-4262 |
Similar Items
-
Partitioning Strategies for Concurrent Programming
by: Devadas, Srinivas, et al.
Published: (2009) -
Partitioning strategies: Spatiotemporal patterns of program decomposition
by: Hoffmann, Henry Christian, et al.
Published: (2010) -
ARCc: A case for an architecturally redundant cache-coherence architecture for large multicores
by: Khan, Omer, et al.
Published: (2012) -
Remote Store Programming: Mechanisms and Performance
by: Wentzlaff, David, et al.
Published: (2009) -
TicToc: Time Traveling Optimistic Concurrency Control
by: Yu, Xiangyao, et al.
Published: (2018)