Show simple item record

Partitioning Strategies for Concurrent Programming

dc.date.accessioned2009-06-16T17:15:03Z
dc.date.accessioned2018-11-26T22:26:00Z
dc.date.available2009-06-16T17:15:03Z
dc.date.available2018-11-26T22:26:00Z
dc.date.issued2009-06-16
dc.identifier.urihttp://hdl.handle.net/1721.1/45567
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/45567
dc.description.abstractThis 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.en_US
dc.format.extent16 p.en_US
dc.titlePartitioning Strategies for Concurrent Programmingen_US


Files in this item

FilesSizeFormatView
MIT-CSAIL-TR-2009-026.pdf295.0Kbapplication/pdfView/Open
MIT-CSAIL-TR-2009-026.ps2.166Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record