Abstract
Mesh partitioning methods for parallel processing aim to split up unstructured meshes to give computational load balance while minimising the interprocessor communication time. Due to the computational cost of an exhaustive search of all possible partitionings many heuristic methods have been developed for this task. We present details of a software program that implements a wide range of partitioning methods to allow easy comparison of method costs and results. It also contains some simple models of communication to estimate the true communication times that result from a given partitioning.
References
Pothen, A., Simon, H.D.: Partitioning sparse matrices with eigenvectors of graphs. Report RNR-89-009, NASA Ames Research Center, July 1989.
Farhat, C., Wilson, W., Powell, G.: Solution of finite element systems on concurrent processing computers. Eng. with Computers, 2, (1987), 157–165.
Kernighan, B., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell System Tech. J. 29, (1970), 291–307.
Barnard, S.T., Simon, H.D.: A fast multilevel implementation of recursive spectral bisection. Proc. 6th SIAM conf. on parallel processing for scientific computing, (1993), 711–718.
Hendrickson, B., Leland, R.: The Chaco User's Guide, version 1.0. Tech. Report SAND93-2339, Sandia National Laboratories, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Greenough, C., Fowler, R. (1998). Software for partitioning finite element meshes. In: Sloot, P., Bubak, M., Hertzberger, B. (eds) High-Performance Computing and Networking. HPCN-Europe 1998. Lecture Notes in Computer Science, vol 1401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037232
Download citation
DOI: https://doi.org/10.1007/BFb0037232
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64443-9
Online ISBN: 978-3-540-69783-1
eBook Packages: Springer Book Archive