Load Balancing for Computational Fluid Dynamics Calculations
- 117 Downloads
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.
KeywordsGrid Point Computational Fluid Dynamic Load Balance Parallel Machine Bisection Method
Unable to display preview. Download preview PDF.
- 1.B. Baldwin and H. Lomax. Thin layer approximation and algebraic model for separated turbulent flows, AIAA-78-257, 1978.Google Scholar
- 3.B.E. Bauer. Practical parallel programming. Academic press, San Diego, 1991.Google Scholar
- 6.T. Bui, C. Heigham, C. Jones, and T. Leighton. Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithm. In 26th ACM/IEEE design automation conference, page 775. IEEE, 1989.Google Scholar
- 10.R. Van Driessche and D. Roose. Load balancing computational fluid dynamics calculations on unstructured grids. In Special course on parallel computing in CFD, number R-807 in AGARD report, pages 2-1 - 2-26, 1995.Google Scholar
- 23.R. Leland and B. Hendrickson. An empirical study of static load balancing algorithms. In Proceedings of the scalable high-performance computing conference, pages 682-685, 1994.Google Scholar
- 26.J. Schabernack. Load balancing algorithms in distributed systems survey and taxonomy. Informationstechnik (IT), 34(5)280–295, 1992.Google Scholar
- 29.M. Streng, H.H. ten Cate, B.J. Geurts, and J.G.M. Kuerten. Simulation of compressible viscous flow on workstation clusters. Memorandum no. 1265, University of Twente, Enschede, 1995.Google Scholar
- 31.A.J. van der Steen, editor. Aspects of computational science. National Computing Facilities Foundation, The Hague, The Netherlands, 1995.Google Scholar
- 32.R. van Driessche and D. Roose. An efficient spectral bisection algorithm for dynamicLeuven, Belgium, 1994.Google Scholar
- 33.R. van Driessche and D. Roose. A graph contraction algorithm for the fast calculation of the Fiedler vector of a graph. In D.H. Bailey etal. , editor, Proceedings of the seventh SI AM Conference on parallel processing for scientific computing, pages 621-626. SIAM, 1995.Google Scholar
- 42.S. Zhou. LSF: load sharing and batch queueing software. Platform Computing Corporation, http://www. plat form. com.Google Scholar