Partitioning Strategies for Concurrent Programming

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 spatiotempo...

Full description

Bibliographic Details
Main Authors: Hoffmann, Henry Christian (Contributor), Agarwal, Anant (Contributor), Devadas, Srinivas (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: 2010-11-05T19:58:08Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items