Parallel Processing of Adaptive Meshes with Load Balancing

Many scientific applications involve grids that lack a uniform underlying structure. These applications are often also dynamic in nature in that the grid structure significantly changes between successive phases of execution. In parallel computing environments, mesh adaptation of unstructured grids through selective refinement/coarsening has proven to be an effective approach. However, achieving load balance while minimizing interprocessor communication and redistribution costs is a difficult problem. Traditional dynamic load balancers are mostly inadequate because they lack a global view of system loads across processors. In this paper, we propose a novel and general-purpose load balancer that utilizes symmetric broadcast networks (SBN) as the underlying communication topology and compare its performance with a successful global load balancing environment, called PLUM, specifically created to handle adaptive unstructured applications. Our experimental results on an IBM SP2 demonstrate that the SBN-based load balancer achieves lower redistribution costs than that under PLUM by overlapping processing and data migration.

[1]  G. Horton A Multi-Level Diffusion Method for Dynamic Load Balancing , 1993, Parallel Comput..

[2]  Vipin Kumar,et al.  Parallel Multilevel k-way Partitioning Scheme for Irregular Graphs , 1996, Proceedings of the 1996 ACM/IEEE Conference on Supercomputing.

[3]  Geoffrey C. Fox,et al.  Graph contraction for physical optimization methods: a quality-cost tradeoff for mapping data on parallel computers , 1993, ICS '93.

[4]  Leonid Oliker,et al.  Experiments with Repartitioning and Load Balancing Adaptive Meshes , 1999 .

[5]  Leonid Oliker,et al.  Parallel tetrahedral mesh adaptation with dynamic load balancing , 2013, Parallel Comput..

[6]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning , 1995 .

[7]  Bruce Hendrickson,et al.  A Multi-Level Algorithm For Partitioning Graphs , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[8]  Nikos Chrisochoides,et al.  MULTITHREADED MODEL FOR DYNAMIC LOAD BALANCING PARALLEL ADAPTIVE PDE COMPUTATIONS , 1995 .

[9]  Gregory Allen Kohring Dynamic Load Balancing for Parallelized Particle Simulations on MIMD Computers , 1995, Parallel Comput..

[10]  Martin G. Everett,et al.  Parallel Dynamic Graph Partitioning for Adaptive Unstructured Meshes , 1997, J. Parallel Distributed Comput..

[11]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning: a survey , 1995, Integr..

[12]  Vipin Kumar,et al.  Multilevel Diffusion Schemes for Repartitioning of Adaptive Meshes , 1997, J. Parallel Distributed Comput..

[13]  George Karypis,et al.  Multilevel k-way Partitioning Scheme for Irregular Graphs , 1998, J. Parallel Distributed Comput..

[14]  Leonid Oliker,et al.  PLUM: Parallel Load Balancing for Adaptive Unstructured Meshes , 1998, J. Parallel Distributed Comput..

[15]  Yifan Hu,et al.  An optimal migration algorithm for dynamic load balancing , 1998 .

[16]  Rupak Biswas,et al.  Adaptive load-balancing algorithms using symmetric broadcast networks: performance study on an IBM SP2 , 1997, Proceedings of the 1997 International Conference on Parallel Processing (Cat. No.97TB100162).

[17]  Y. Kallinderis,et al.  Parallel dynamic load-balancing algorithm for three-dimensional adaptive unstructured grids , 1994 .

[18]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[19]  Leonid Oliker,et al.  A Comparison of Three Programming Models for Adaptive Applications on the Origin2000 , 2000, ACM/IEEE SC 2000 Conference (SC'00).