Published May 14, 2001
| Submitted
Report
Open
Integrating Task and Data Parallelism
- Creators
- Massingill, Berna
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.
Additional Information
© Berna Massingill 1993 California Institute of Technology. Submitted 3 May 1993. The research described in this report was supported in part by an Air Force Laboratory Graduate Fellowship (under the sponsorship of Phillips Laboratory at Kirtland AFB Albuquerque NM) in part by a Milton E. Mohr Graduate Fellowship (administered by Caltech) in part by the Air Force Office of Scientic Research under grant number AFOSR-91-0070, and in part by the NSF under Cooperative Agreement No. CCR-9120008. The government has certain rights in this material.Attached Files
Submitted - 93-01.pdf
Submitted - 93-01.ps
Files
93-01.pdf
Additional details
- Eprint ID
- 26854
- Resolver ID
- CaltechCSTR:1993.cs-tr-93-01
- Air Force Laboratory Graduate Fellowship
- Caltech Milton E. Mohr Graduate Fellowship
- AFOSR-91-0070
- Air Force Office of Scientific Research (AFOSR)
- CCR-9120008
- NSF
- Created
-
2001-05-14Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Caltech groups
- Computer Science Technical Reports