Dynamic mesh partitioning: a unified optimisation and load-balancing algorithm

A parallel method for dynamic partitioning of unstructured meshes is described. The method employs a new unified iterative optimisation technique which both balances the workload and attempts to minimise the interprocessor communications overhead. Experiments on a series of adaptively refined meshes indicate that the algorithm provides partitions of an equivalent quality to static partitioners (which do not reuse the existing partition) and much more quickly. Perhaps more importantly, the algorithm results in only a small fraction of the amount of data migration compared to the static partitioners.

[1]  Stéphane Lanteri,et al.  TOP/DOMDEC : a software tool for mesh partitioning and parallel processing and applications to CSM a , 1995 .

[2]  Rainald Loehner,et al.  A parallelizable load balancing algorithm , 1993 .

[3]  Charbel Farhat,et al.  A simple and efficient automatic fem domain decomposer , 1988 .

[4]  Mukesh Singhal,et al.  Load distributing for locally distributed systems , 1992, Computer.

[5]  Roy D. Williams,et al.  Performance of dynamic load balancing algorithms for unstructured mesh calculations , 1991, Concurr. Pract. Exp..

[6]  Chris Bailey,et al.  Multiphysics modelling of the metals casting process , 1996, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[7]  Dirk Roose,et al.  An Improved Spectral Bisection Algorithm and its Application to Dynamic Load Balancing , 1995, EUROSIM International Conference.

[8]  D WilliamsRoy.  Performance of dynamic load balancing algorithms for unstructured mesh calculations , 1991 .

[9]  Martin G. Everett,et al.  A Localized Algorithm for Optimizing Unstructured Mesh Partitions , 1995, Int. J. High Perform. Comput. Appl..

[10]  Martin Berzins,et al.  Dynamic load-balancing for PDE solvers on adaptive unstructured meshes , 1995, Concurr. Pract. Exp..

[11]  Steven J. Plimpton,et al.  Parallel Algorithms for Dynamically Partitioning Unstructured Grids , 1995, PPSC.

[12]  Martin G. Everett,et al.  Partitioning & Mapping of Unstructured Meshes to Parallel Machine Topologies , 1995, IRREGULAR.

[13]  G. Kedem,et al.  An algorithm for quadrisection and its application to standard cell placement , 1988 .

[14]  Stephen Johnson,et al.  Integrated flow and stress using an unstructured mesh on distributed memory parallel systems , 1995 .

[15]  George Cybenko,et al.  Dynamic Load Balancing for Distributed Memory Multiprocessors , 1989, J. Parallel Distributed Comput..

[16]  Charles M. Fiduccia,et al.  A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.

[17]  John E. Savage,et al.  Parallelism in Graph-Partitioning , 1991, J. Parallel Distributed Comput..

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

[19]  Roy Williams.  DIME Distributed Irregular Mesh Environment , 1990 .

[20]  Charbel Farhat,et al.  Beyond Conventional Mesh Partitioning Algorithms and the Minimum Edge Cut Criterion: Impact on Realistic Realistic Applications , 1995, PPSC.

[21]  Horst D. Simon,et al.  Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems , 1994, Concurr. Pract. Exp..

[22]  Brian Kernighan,et al.  An efficient heuristic for partitioning graphs , 1970 .