Orthogonal Processor Groups for Message-Passing Programs
We consider a generalization of the SPMD programming model to orthogonal processor groups. In this model different partitions of the processors into disjoint processor groups can be exploited simultaneously in a single parallel implementation. The parallel programming model is appropriate for grid based applications working in horizontal or vertical directions as well as and for mixed task and data parallel computations. For those applications we propose a systematic development process for message-passing programs using orthogonal processor groups. The development process starts with a specification of tasks indicating horizontal and vertical sections. A mapping to orthogonal processor groups realizes a group SPMD execution model and a final transformation step generates the corresponding message-passing program.
KeywordsVertical Section Orthogonal Group Program Part Collective Communication Potential Parallelism
- 3.A. Dierstein, R. Hayer, and T. Rauber. The ADDAP System on the iPSC/860: Automatic Data Distribution and Parallelization. JPDC, 32(1):1–10, 1996.Google Scholar
- 4.S.R. Kohn and S.B. Baden. Irregular Coarse-Grain Data Parallelism under LPARX. Scientific Programming, 5:185–201, 1995.Google Scholar
- 10.G. Zhang, B. Carpenter, G. Fox, X. Li, and Y. Wen. A high level SPMD programming model: HPspmd and its Java language binding. Technical report, NPAC at Syracuse Univ., 1998.Google Scholar