An element-based concurrent partitioner for unstructured finite element meshes

A concurrent partitioner for partitioning unstructured finite element meshes on distributed memory architectures is developed. The partitioner uses an element-based partitioning strategy. Its main advantage over the more conventional node-based partitioning strategy is its modular programming approach to the development of parallel applications. The partitioner first partitions element centroids using a recursive inertial bisection algorithm. Elements and nodes then migrate according to the partitioned centroids, using a data request communication template for unpredictable incoming messages. Our scalable implementation is contrasted to a non-scalable implementation which is a straightforward parallelization of a sequential partitioner. The algorithms adopted in the partitioner scale logarithmically, as confirmed by actual timing measurements on the Intel Delta on up to 512 processors for scaled size problems.

[1]  Horst D. Simon,et al.  Partitioning of unstructured problems for parallel processing , 1991 .

[2]  B. Nour-Omid,et al.  Solving finite element equations on concurrent computers , 1987 .

[3]  Chris H. Q. Ding,et al.  Slices: A Scalable Partitioner for Finite Element Meshes , 1995, PPSC.

[4]  Chris H. Q. Ding,et al.  A general purpose sparse matrix parallel solvers package , 1995, Proceedings of 9th International Parallel Processing Symposium.

[5]  Bruce Hendrickson,et al.  An empirical study of static load balancing algorithms , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

[6]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[7]  Mark T. Jones,et al.  Parallel algorithms for the adaptive refinement and partitioning of unstructured meshes , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.