Thinking Machines' CM-5 machine is a distributed-memory, message-passing computer. In the paper we devise a performance benchmark for the base and vector units and the data communication networks of the CM-5 machine. We model the communication characteristics such as communication latency and bandwidths of point-to-point and global communication primitives. We show, on a simple Gaussian elimination code, that an accurate static performance estimation of parallel algorithms is possible by using those basic machine properties connected with computation, vectorization, communication and synchronization. Futhermore, we describe the embedding of meshes or hypercubes on the CM-5 fat-tree topology and illustrate the performance results of their basic communication primitives.

This paper describes the design of the Fortran90D/HPF compiler, a source-to-source parallel compiler for distributed memory systems being developed at Syracuse University. Fortran 90D/HPF is a data parallel language with special directives to specify data alignment and distributions. A systematic methodology to process distribution directives of Fortran 90D/HPF is presented. Furthermore, techniques for data and computation partitioning, communication detection and generation, and the run-time support for the compiler are discussed. Finally, initial performance results for the compiler are presented. We believe that the methodology to process data distribution, computation partitioning, communication system design, and the overall compiler design can be used by the implementors of compilers for HPF.

90D\HPF is a data parallel lanquage w~ih speczal directives to enable users to spectfy data a[ignment and distributions.This paper describes the design and implementation of a Fortran!)ODjHPF compiler.Techniques for data and computation partitioning, communication detect ton and generation, and the run-ttme support for the compiler are dtscussed.Finally, tn~txal performance results for the cornptler are presented.We belteve that the methodology to process data dtstributton, computation partittontngl conlmunz catton system design and the overall comptler destgn can be used by the implementors of HPF compzlers.1 Introduction Currently, distributed melmory machines are programmed using a node language and a message passing library.This process is tedious and error prone because the user must perform the task of data distribution and communication for non-local data access.There has been significant research in developing parallelizing compilers.In this approach, the compiler takes a sequential Fortran 77 program as input, applies a set of transformation rules, and produces a parallelized code for the target machine.However, a sequential language, such as Fortran 77, obscures the parallelism of a problem in sequential loops and other sequential constructs.This makes the potential parallelism of a program more difficult to detect by a parallelizing compiler.Therefore, compiling a sequential program into a parallel program is not a natural approach.An alternative approach is to use