Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
Distributed environment and load balancing for adaptive unstructured meshes
Distributed environment and load balancing for adaptive unstructured meshes
A conjugate gradient method for the spectral partitioning of graphs
Parallel Computing
Parallel automatic adaptive analysis
Parallel Computing - Special issue on applications: parallel computing methods in applied fluid mechanics
Journal of Parallel and Distributed Computing - Special issue on dynamic load balancing
Parallel structures and dynamic load balancing for adaptive finite element computation
Proceedings of international centre for mathematical sciences on Grid adaptation in computational PDES : theory and applications: theory and applications
Multilevel k-way partitioning scheme for irregular graphs
Journal of Parallel and Distributed Computing
PLUM: parallel load balancing for adaptive unstructured meshes
Journal of Parallel and Distributed Computing
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Parallel tetrahedral mesh adaptation with dynamic load balancing
Parallel Computing - Special issue on graph partioning and parallel computing
A unified algorithm for load-balancing adaptive scientific simulations
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Reducing the bandwidth of sparse symmetric matrices
ACM '69 Proceedings of the 1969 24th national conference
Serial and parallel dynamic adaptation of general hybrid meshes
Serial and parallel dynamic adaptation of general hybrid meshes
| Hi-index | 31.49 |
A new parallel dynamic mesh adaptation and load balancing algorithm for general hybrid grids has been developed. The meshes considered in this work are composed of four kinds of elements; tetrahedra, prisms, hexahedra and pyramids, which poses a challenge to parallel mesh adaptation. Additional complexity imposed by the presence of multiple types of elements affects especially data migration, updates of local data structures and interpartition data structures. Efficient partition of hybrid meshes has been accomplished by transforming them to suitable graphs and using serial graph partitioning algorithms. Communication among processors is based on the faces of the interpartition boundary and the termination detection algorithm of Dijkstra is employed to ensure proper flagging of edges for refinement. An inexpensive dynamic load balancing strategy is introduced to redistribute work load among processors after adaptation. In particular, only the initial coarse mesh, with proper weighting, is balanced which yields savings in computation time and relatively simple implementation of mesh quality preservation rules, while facilitating coarsening of refined elements. Special algorithms are employed for (i) data migration and dynamic updates of the local data structures, (ii) determination of the resulting interpartition boundary and (iii) identification of the communication pattern of processors. Several representative applications are included to evaluate the method.