Title :
Composites: trees for data parallel programming
Author :
Carroll, Mark C. ; Pollock, Lori
Author_Institution :
Dept. of Comput. Sci., Delaware Univ., Newark, DE, USA
Abstract :
Data parallel programming languages offer ease of programming and debugging and scalability of parallel programs to increasing numbers of processors. Unfortunately, the usefulness of these languages for non-scientific programmers and loosely coupled parallel machines is currently limited. We present the composite tree model which seeks to provide greater flexibility via parallel data types, support for more general, hierarchical parallelism, parallel control flow, and efficient execution on loosely coupled, coarse grained parallel machines such as workstation networks. The composite tree model is a new model of parallel programming based on merging data parallelism with object oriented programming languages, and can be implemented as a small set of extensions to any pure, static typed, object oriented programming language
Keywords :
object-oriented languages; object-oriented programming; parallel languages; parallel programming; tree data structures; coarse grained parallel machines; composite tree model; data parallel programming; data parallel programming languages; data parallelism; debugging; hierarchical parallelism; loosely coupled parallel machines; nonscientific programmers; object oriented programming languages; parallel control flow; parallel data types; program scalability; static typed; trees; workstation networks; Data structures; Debugging; Object oriented modeling; Object oriented programming; Parallel languages; Parallel machines; Parallel processing; Parallel programming; Programming profession; Workstations;
Conference_Titel :
Computer Languages, 1994., Proceedings of the 1994 International Conference on
Conference_Location :
Toulouse
Print_ISBN :
0-8186-5640-X
DOI :
10.1109/ICCL.1994.288394
