Abstract
COUPL+ is a simple and relatively complete environment for applications that make use of unstructured and hybrid grids for numerical simulations. The package automates parallelization of applications by handling the partitioning of data and dependent data. Primitives are provided to maintain halo interfaces and ensure copy coherency. This paper explores some of the algorithms behind the COUPL+ library, analysing the performance on a cluster of P-II-450 workstations. A multilevel partitioning algorithm for skewed data is presented, involving solving the multi-set median-finding problem. Partitioning elements over a set of pre-partitioned nodes is explored and a novel solution is found reducing communication requirements of the resulting distribution.
This work was partly funded by the European Community as part of the JULIUS project under contract ESPRIT EP25050
Smith Institute Research Fellow
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Farhat. A simple and efficient automatic FEM domain decomposer. Computation and Structures, 28(5):579–602, 1988.
GBD+94._A. Geist, A. Beguelin, J. Dongarra, J. Weicheng, R. Manchek, and V. Sunderam. PVM: A Users’ Guide and Tutorial for Networked Parallel Computing. MIT Press, 1994.
A. V. Gerbessiotis and C. J. Siniolakis. Deterministic sorting and randomized median finding on the BSP model. In 8th ACM Symposium on Parallel Algorithms and Architectures (SPAA’96). ACM Press, June 1996.
B. Hendrickson. Graph partitioning and parallel solvers: Has the Emperor no clothes. In Irregular’ 98, 1998.
J. JáJá. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
G. Karypis and V. Kumar. Parallel multilevel k-way partitioning scheme for irregular graphs. In Supercomputing 1996, 1996.
B. W. Kernighan and S. Lin. An efficient heuristic for partitioning graphs. Bell System Technical Journal, 49(2):291–307, 1970.
M. Rudgyard, D. Lecomber, and T. Schönfeld. The COUPL+ User Manual, 1998.
M. Rudgyard, T. Schönfeld, and I. D’Ast. A parallel library for CFD and other grid-based applications. Lecture Notes in Computer Science, 1067, 1996.
H. D. Simon. Partitioning of unstructured problems for parallel processing. Computational Systems Engineering, 36(5):745–764, 1991.
SOHL+95._M. Snir, S. W. Otto, S. Huss-Lederman, D. W. Walker, and J. Dongarra. MPI: The Complete Reference. MIT Press, 1995.
L. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103–111, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lecomber, D., Rudgyard, M. (2000). Algorithms for Generic Tools in Parallel Numerical Simulation. In: Bubak, M., Afsarmanesh, H., Hertzberger, B., Williams, R. (eds) High Performance Computing and Networking. HPCN-Europe 2000. Lecture Notes in Computer Science, vol 1823. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45492-6_6
Download citation
DOI: https://doi.org/10.1007/3-540-45492-6_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67553-2
Online ISBN: 978-3-540-45492-2
eBook Packages: Springer Book Archive