Load Balancing for Computational Fluid Dynamics Calculations

Many problems in computational fluid dynamics can be solved numerically by representing the flow on a finite set of points, the grid. The solution procedure typically proceeds by repeated application of some calculations for each point x in the grid, using the values of the flow-field in several grid points in a neighbourhood of x. Provided this neighbourhood is not too large, a common way to perform these calculations on a parallel computer, is by employing domain-decomposition. In such a technique, the computational domain is partitioned into subdomains. Each subdomain contains a subset of all the points in the original grid, and is assigned to a processor of the parallel machine. Each processor performs the calculations for the points in the subdomain(s) assigned to it. For the computations for the points on the boundaries between two subdomains, information is needed concerning the flow-field in some points in the neighbouring subdomains. Therefore, the processors have to communicate at regular intervals. E g in the solution of a time-dependent flow-problem, communication will typically take place (at least) every timestep. The parallel computer is used optimally if none of the processors have to wait for information they need from other processors. Therefore it is important to assign subdomains representing appropriate amounts of work to each processor.

[1]  Cheng-Zhong Xu,et al.  Iterative Dynamic Load Balancing in Multicomputers , 1994 .

[2]  Hasan U. Akay,et al.  Dynamic load balancing on a network of workstations for solving computational fluid dynamics problems , 1994 .

[3]  Dirk Roose,et al.  A Grapg Contraction Algorithm for the Fast Calculation of the Fiedler Vector of a Graph , 1995, PPSC.

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

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

[6]  Charbel Farhat,et al.  Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanics , 1993 .

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

[8]  Viktor K. Decyk,et al.  Dynamic load balancing for a 2D concurrent plasma PIC code , 1993 .

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

[10]  Johan De Keyser,et al.  Run-Time Load Balancing Techniques for a Parallel Unstructured Multi-Grid Euler Solver with Adaptive Grid Refinement , 1995, Parallel Comput..

[11]  Francis C. M. Lau,et al.  Anlaysis of the Generalized Dimension Exchange Method for Dynamic Load Balancing , 1992, J. Parallel Distributed Comput..

[12]  Francis C. M. Lau,et al.  Nearest-neighbor algorithms for load-balancing in parallel computers , 1995, Concurr. Pract. Exp..

[13]  Dirk Roose,et al.  An efficient spectral bisection algorithm for dynamic load balancing , 1994 .

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

[15]  Reinhard von Hanxleden,et al.  Load Balancing on Message Passing Architectures , 1991, J. Parallel Distributed Comput..

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

[17]  Volker Strumpen,et al.  Efficient Parallel Computing in Distributed Workstation Environments , 1993, Parallel Comput..

[18]  Jianjian Song A Partially Asynchronous and Iterative Algorithm for Dstributed Load Balancing , 1994, Parallel Comput..

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

[20]  Olivier C. Martin,et al.  Partitioning of unstructured meshes for load balancing , 1995, Concurr. Pract. Exp..

[21]  M. Fiedler A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

[22]  M. Fiedler Algebraic connectivity of graphs , 1973 .

[23]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

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

[25]  Gregory V. Wilson,et al.  Practical parallel programming , 1999, IEEE Concurr..

[26]  Johan De Keyser,et al.  Run-Time Load Balancing Support for a Parallel Multiblock Euler/Navier-Stokes Code with Adaptive Refinement on Distributed Memory Computers , 1994, Parallel Comput..

[27]  H. Lomax,et al.  Thin-layer approximation and algebraic model for separated turbulent flows , 1978 .

[28]  Frank Thomson Leighton,et al.  Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms , 1989, 26th ACM/IEEE Design Automation Conference.

[29]  J. E. Boillat,et al.  A dynamic load-balancing algorithm for molecular dynamics simulation on multi-processor systems , 1991 .

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

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

[32]  Charbel Farhat,et al.  Implicit parallel processing in structural mechanics , 1994 .

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

[34]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[35]  Jacques E. Boillat,et al.  Load Balancing and Poisson Equation in a Graph , 1990, Concurr. Pract. Exp..

[36]  Nicolai Petkov,et al.  Aspects of Computational Science , 1995 .

[37]  Gene H. Golub,et al.  Matrix computations , 1983 .

[38]  M. Shephard,et al.  Load balancing for the parallel adaptive solution of partial differential equations , 1994 .