A parallel dynamic load balancing algorithm for 3-D adaptive unstructured grids
A. Vidwans, Y. Kallinderis, Venkat N. Venkatakrishnan · 1993
Adaptive local grid refinement/coarsening results in unequal distribution of workload among the processors of a parallel system. A novel method for balancing the load in cases of dynamically changing tetrahedral grids is developed. The approach Graduate Research Assistant, Dept. of Electrical and Computer Engineering y Assistant Professor, Member AIAA z Research Scientist, Member AIAA 1 employs local exchange of cells among processors in order to redistribute the load equally. An important part of the load balancing algorithm is the method employed by a processor to determine which cells within its subdomain are to be exchanged. Two such methods are presented and compared. The strategy for load balancing is based on the Divide-and-Conquer approach which leads to an efficient parallel algorithm. This method is implemented on a distributed-memory MIMD system. 1 Introduction Computational fluid dynamics (CFD) has advanced rapidly over the last two decades and it is recognized as a...