Integrating Task and Data Parallelism
Many models of concurrency and concurrent programming have been proposed; most can be categorized as either task-parallel (based on functional decomposition) or data-parallel (based on data decomposition). Task-parallel models are most effective for expressing irregular computations; data-paralle...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
1993
|
| Online Access: | https://thesis.library.caltech.edu/6920/1/Massingill_b_1993.pdf Massingill, Berna Linda (1993) Integrating Task and Data Parallelism. Master's thesis, California Institute of Technology. doi:10.7907/a7ga-s950. https://resolver.caltech.edu/CaltechTHESIS:04122012-130550435 <https://resolver.caltech.edu/CaltechTHESIS:04122012-130550435> |
| Summary: | Many models of concurrency and concurrent programming have been proposed; most can
be categorized as either task-parallel (based on functional decomposition) or data-parallel
(based on data decomposition). Task-parallel models are most effective for expressing irregular
computations; data-parallel models are most effective for expressing regular computations.
Some computations, however, exhibit both regular and irregular aspects. For
such computations, a better programming model is one that integrates task and data parallelism.
This report describes one model of integrating task and data parallelism, some
problem classes for which it is effective, and a prototype implementation. |
|---|