Data-parallel programming on MIMD computers
- 1 July 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 2 (3), 377-383
- https://doi.org/10.1109/71.86112
Abstract
The implementation of two compilers for the data-parallel programming language Dataparallel C is described. One compiler generates code for Intel and nCUBE hypercube multicomputers; the other generates code for Sequent multiprocessors. A suite of Dataparallel C programs has been compiled and executed, and their execution times and speedups on the Intel iPSC/2, the nCUBE 3200 and the Sequent Symmetry are presented.<>Keywords
This publication has 15 references indexed in Scilit:
- Supporting shared data structures on distributed memory architecturesPublished by Association for Computing Machinery (ACM) ,1990
- How to write parallel programs: a guide to the perplexedACM Computing Surveys, 1989
- Process decomposition through locality of referencePublished by Association for Computing Machinery (ACM) ,1989
- Linda in contextCommunications of the ACM, 1989
- Compiling programs for distributed-memory multiprocessorsThe Journal of Supercomputing, 1988
- Development of Parallel Methods for a $1024$-Processor HypercubeSIAM Journal on Scientific and Statistical Computing, 1988
- Compiling C* programs for a hypercube multicomputerPublished by Association for Computing Machinery (ACM) ,1988
- SUPERB: A tool for semi-automatic MIMD/SIMD parallelizationParallel Computing, 1988
- Data parallel algorithmsCommunications of the ACM, 1986
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972