Login

Partitioning Strategies for Concurrent Programming

Show full item record




Title: Partitioning Strategies for Concurrent Programming
Author: Devadas, Srinivas; Agarwal, Anant; Hoffmann, Henry
Other Contributors: Computer Architecture
Advisor: Srini Devadas
Issue Date: 2009-06-16
Abstract: 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 nature. Therefore, data and instruction decomposition are further distinguished by whether the partitioning is done in the spatial or in temporal dimension. Thus, this work describes four decomposition strategies: spatial data partitioning (SDP), temporal data partitioning (TDP), spatial instruction partitioning (SIP), and temporal instruction partitioning (TIP), while cataloging the benefits and drawbacks of each. In addition, the practical use of these strategies is demonstrated through a case study in which they are applied to implement several different parallelizations of a multicore H.264 encoder for HD video. This case study illustrates both the application of the patterns and their effects on the performance of the encoder.
URI: http://hdl.handle.net/1721.1/45567
Series/Report no.: MIT-CSAIL-TR-2009-026

Files in this item

Files Size Format
MIT-CSAIL-TR-2009-026.pdf 295.0Kb application/pdf
MIT-CSAIL-TR-2009-026.ps 2.166Mb application/postscript

This item appears in the following Collection(s)

Show full item record

Search DSpace@MIT


Advanced Search

Browse

My Account

Links