This Article 
 Bibliographic References 
 Add to: 
Data-Parallel Programming on MIMD Computers
July 1991 (vol. 2 no. 3)
pp. 377-383

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.

[1] R. G. Babb, II,Programming Parallel Processors. Reading, MA: Addison-Wesley, 1988.
[2] A. H. Karp and R. G. Babb, II, "A comparison of 12 parallel Fortran dialects,"IEEE Software, pp. 52-67.
[3] S. J. Allan and R. R. Oldehoeft, "HEP SISAL: Parallel functional programming," inParallel MIMD Computation: HEP Supercomputer and Its Applications. Cambridge, MA: MIT Press, 1985, pp. 123-150.
[4] J. McGraw and T.S. Axelrod, "Exploiting Multiprocessors: Issues and Options," inProgramming Parallel Processors, R.G. Babb, ed., Addison-Wesley, Reading, Mass., 1987.
[5] L. Storc, "Sequent Balance series," inProgramming Parallel Processors. Reading, MA: Addison-Wesley, 1988, pp. 143-154.
[6] W. A. Wulf, R. Levin, and S. P. Harbison,HYDRA/C.mmp: An Experimental Computer System. New York: McGraw-Hill, 1981, p. 277.
[7] P. C. Miller, C. E. S. John, and S. W. Hawkinson, "FPS T Series parallel computer," inProgramming Parallel Processors. Reading, MA: Addison-Wesley, 1988, pp. 73-91.
[8] M. C. Chen, "Very-high-level parallel programming in Crystal," inProc. Hypercube Multiprocessors 1987, Philadelphia, PA, SIAM, 1987, pp. 39-47.
[9] D. M. Pase and A. R. Larrabee, "Intel iPSC concurrent computer," inProgramming Parallel Processors. Reading, MA: Addison-Wesley, 1988, pp. 105-124.
[10] W. D. Hillis and G. L. Steele, Jr., "Data parallel algorithms,"Commun. ACM, vol. 29, no. 12, pp. 1170-1183, Dec. 1986.
[11] J. R. Rose and G. L. Steele, Jr, "C*: An extended C language for data parallel programming," Tech. Rep. PL 87-5, Thinking Machines Corp., Cambridge, MA, 1987.
[12] "C*programming guide," Aug. 1990. Version 6.0 Beta, Thinking Machines Corp., Cambridge, MA.
[13] M. J. Quinn and P. J. Hatcher, "Compiling SIMD programs for MIMD architectures," inProc. 1990 Int. Conf. Comput. Languages, IEEE Computer Society Press, 1990, pp. 291-296.
[14] M. J. Quinn and P. J. Hatcher, "Data-parallel programming on multicomputers,"IEEE Software, vol. 7, pp. 69-76, Sept. 1990.
[15] M. J. Quinn, P. J. Hatcher, and B. K. Seevers, "Implementing a data parallel language on a tightly coupled multiprocessor," inProc. Third Workshop Programming Languages Compilers Parallel Computers, Pitman/The MIT Press, 1991.
[16] L. H. Hamel, P. J. Hatcher, and M. J. Quinn, "An optimizing compiler for a hypercube multicomputer," inLanguages, Compilers and Run-Time Environments for Distributed Memory Machines. New York: Elsevier, 1991.
[17] P.J. Hatcher, "A Production-Quality C*Compiler for Hypercube Multicomputers,"Proc. Third ACM SIGPLAN Symp. Principles and Practice of Parallel Programming, ACM Press, New York, 1991.
[18] F. Gavril, "Algorithms for minimum coloring, maximum clique, minimum coverage by cliques, and maximum independent set of a chordal graph,"SIAM J. Comput., vol. 1, no. 2, pp. 180-187, 1972.
[19] M. Quinn,Designing Efficient Algorithms for Parallel Computers. New York: McGraw-Hill, 1987.
[20] J. L. Gustafson, G. R. Montry, and R. E. Benner, "Development of parallel methods for a 1024-processor hypercube,"SIAM J. Scientif. Statist. Comput., vol. 9, July 1988.
[21] M. J. Quinn, P. J. Hatcher, and K. C. Jourdenais, "Compiling C* programs for a hypercube multicomputer," inProc. ACM SIGPLAN Parallel Programming: Experience with Appl., Languages, Syst., 1988, pp. 57-65.
[22] D. Callahan and K. Kennedy, "Compiling programs for distributed-memory multiprocessors,"J. Supercomput., vol. 2, no. 2, pp. 151-169, 1988.
[23] A. Rogers and K. Pingali, "Process decomposition through locality of reference," inProc. SIGPLAN'89 Conf. Programming Language Design and Implementation, 1989, pp. 69-80.
[24] H. P. Zima, H.-J. Bast, and M. Gerndt, "SUPERB--A tool for semi-automatic MIMD/SIMD parallelization,"Parallel Comput., vol. 6, pp. 1-18, 1988.
[25] N. Carriero and D. Gelernter, "Linda in context,"Commun. ACM, vol. 32, pp. 444-458, Apr. 1989.
[26] N. Carriero and D. Gelernter, "How to Write Parallel Programs: A Guide to the Perplexed,"ACM Computing Surveys, Vol. 21, No. 3, Sept. 1989, pp. 323-357.
[27] I. Foster and S. Taylor,Strand: Concepts in Parallel Programming, Prentice Hall, Englewoold Cliffs, N.J., 1989.
[28] J. C. Browne, "Software engineering of parallel programs in a computationally oriented display environment," inLanguages and Compilers for Parallel Computing. Cambridge, MA: MIT Press, 1990, pp. 75-94.
[29] W. G. Rudd and T. G. Lewis, "Architecture of the Parallel Program Support Environment," inProc. CompCon '90, Feb. 1990, pp. 589-594.
[30] M. Rosing, R. B. Schnabel, and R. P. Weaver, "Dino: Summary and examples," inProc. Third Conf. Hypercube Concurrent Comput. Appl., 1988, pp. 312-316.
[31] M. Rosing, R. B. Schnabel, and R. P. Weaver, "Expressing complex parallel algorithms in DINO," inProc. Fourth Conf. Hypercubes, Concurrent Comput. Appl., 1989, pp. 553-560.
[32] C. Koelbel, P. Mehrotra, and J. Van Rosendale, "Supporting shared data structures on distributed memory architectures," inProc. 2nd ACM SIGPLAN Symp. Principles Practice of Parallel Programming, Mar. 1990, Rep. 90-7, ICASE, Jan. 1990.

Index Terms:
Index Termscompilers; data-parallel programming language Dataparallel C; Intel; nCUBE hypercubemulticomputers; Sequent multiprocessors; Dataparallel C programs; execution times;speedups; Intel iPSC/2; nCUBE 3200; Sequent Symmetry; C language; hypercubenetworks; parallel languages; parallel programming; program compilers
P.J. Hatcher, M.J. Quinn, A.J. Lapadula, B.K. Seevers, R.J. Anderson, R.R. Jones, "Data-Parallel Programming on MIMD Computers," IEEE Transactions on Parallel and Distributed Systems, vol. 2, no. 3, pp. 377-383, July 1991, doi:10.1109/71.86112
Usage of this product signifies your acceptance of the Terms of Use.