Partitioning Strategies for Concurrent Programming
This work presents four partitioning strategies, or 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 spatiotemporal in...
Main Authors: | Devadas, Srinivas, Agarwal, Anant, Hoffmann, Henry |
---|---|
Other Authors: | Srini Devadas |
Published: |
2009
|
Online Access: | http://hdl.handle.net/1721.1/45567 |
Similar Items
-
Partitioning Strategies for Concurrent Programming
by: Hoffmann, Henry Christian, et al.
Published: (2010) -
Partitioning strategies: Spatiotemporal patterns of program decomposition
by: Hoffmann, Henry Christian, et al.
Published: (2010) -
Remote Store Programming: Mechanisms and Performance
by: Wentzlaff, David, et al.
Published: (2009) -
ARCc: A case for an architecturally redundant cache-coherence architecture for large multicores
by: Khan, Omer, et al.
Published: (2012) -
TicToc: Time Traveling Optimistic Concurrency Control
by: Yu, Xiangyao, et al.
Published: (2018)