Massingill, Berna (1993) Integrating Task and Data Parallelism. California Institute of Technology . (Unpublished) http://resolver.caltech.edu/CaltechCSTR:1993.cs-tr-93-01
|
Postscript
See Usage Policy. 652Kb | |
|
PDF
See Usage Policy. 3068Kb |
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechCSTR:1993.cs-tr-93-01
Abstract
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.
| Item Type: | Report or Paper (Technical Report) |
|---|---|
| Group: | Computer Science Technical Reports |
| Record Number: | CaltechCSTR:1993.cs-tr-93-01 |
| Persistent URL: | http://resolver.caltech.edu/CaltechCSTR:1993.cs-tr-93-01 |
| Usage Policy: | You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format. |
| ID Code: | 26854 |
| Collection: | CaltechCSTR |
| Deposited By: | Imported from CaltechCSTR |
| Deposited On: | 14 May 2001 |
| Last Modified: | 26 Dec 2012 14:07 |
Repository Staff Only: item control page


