Abstract
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[2]. 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S.B. Baden and S.J. Fink. A Programming Methodology for Dual-Tier Multicomputers. IEEE Transactions on Software Engineering, 26(3):212–226, 2000.
H. Bal and M. Haines. Approaches for Integrating Task and Data Parallelism. IEEE Concurrency, 6(3):74–84, July-August 1998.
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.
S.R. Kohn and S.B. Baden. Irregular Coarse-Grain Data Parallelism under LPARX. Scientific Programming, 5:185–201, 1995.
T. Rauber and G. Rünger. Parallel Execution of Embedded and Iterated Runge-Kutta Methods. Concurrency: Practice and Experience, 11(7):367–385, 1999.
T. Rauber and G. Rünger. A Transformation Approach to Derive Efficient Parallel Implementations. IEEE Transactions on Software Engineering, 26(4):315–339, 2000.
T. Rauber and G. Rünger. Deriving Array Distributions by Optimization Techniques. Journal of Supercomputing, 15:271–293, 2000.
E. van de Velde. Data Redistribution and Concurrency. Parallel Computing, 16: 125–138, 1990.
P.J. van der Houwen and B.P. Sommeijer. Parallel Iteration of high-order Runge-Kutta Methods with stepsize control. J. Comp. Applied Mathematics, 29:111–127, 1990.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rauber, T., Reilein, R., Rünger, G. (2001). Orthogonal Processor Groups for Message-Passing Programs. In: Hertzberger, B., Hoekstra, A., Williams, R. (eds) High-Performance Computing and Networking. HPCN-Europe 2001. Lecture Notes in Computer Science, vol 2110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48228-8_37
Download citation
DOI: https://doi.org/10.1007/3-540-48228-8_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42293-8
Online ISBN: 978-3-540-48228-4
eBook Packages: Springer Book Archive