ACM Home Page
Please provide us with feedback. Feedback
Global load balancing with parallel mesh adaption on distributed-memory systems
Full text PdfPdf (215 KB)
Source Conference on High Performance Networking and Computing archive
Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) table of contents
Pittsburgh, Pennsylvania, United States
Article No. 33  
Year of Publication: 1996
ISBN:0-89791-854-1
Authors
Rupak Biswas  Research Institute for Advanced Computer Science, Mail Stop T27A-1, NASA Ames Research Center, Moett Field, CA
Leonid Oliker  Research Institute for Advanced Computer Science, Mail Stop T27A-1, NASA Ames Research Center, Moett Field, CA
Andrew Sohn  Dept. of Computer and Information Science, New Jersey Institute of Technology, Newark, NJ
Sponsor
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 20,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/369028.369098
What is a DOI?

ABSTRACT

Dynamic mesh adaption on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load imbalance among processors on a parallel machine. This paper describes the parallel implementation of a tetrahedral mesh adaption scheme and a new global load balancing method. A huristic remapping algorithm is presented that assigns partitions to processors such that the redistribution cost is minimized. Results indicate that the paralel performance of the mesh adaption code depends on the nature of the adaption region and show a 35.5X speedup on 64 processors when about 35% of the mesh is randomly adapted. For large-scale scientific computations, our load balancing strategy gives almost a sixfold reduction in solver execution times over non-balanced loads. Furthermore, our heuristic remapper yields processor assignments that are less than 3% off the optimal solutions but requries only 1% of the computational time.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
R. Biswas, S. Thomas, and S. Cliff, An Edge-Based Solution-Adaptive Method Applied to the AIRPLANE Code, 34th AIAA Aerospace Sciences Meeting, Paper 96-0553, 1996.
 
3
 
4
Y. Deng, R. McCoy, R. Marr, and R. Peierls, An Unconventional Method for Load Balancing, 7th SIAM Conference on Parallel Processing for Scientific Computing, pp. 605-610, 1995.
 
5
E. Duque, R. Biswas, and R. Strawn, A Solution Adaptive Structured/Unstructured Overset Grid Flow Solver with Applications to Helicopter Rotor Flows, 13th AIAA Applied Aerodynamics Conference, Paper 95-1766, 1995.
6
7
 
8
B. Hendrickson and R. Leland, The Chaco user's guide --- Version 2.0, Sandia National Laboratories, Technical Report SAND94-2692, 1994.
 
9
G. Horton, A Multilevel Diffusion Method for Dynamic Load Balancing, Parallel Computing, Vol. 19, pp. 209-229, 1993.
10
 
11
 
12
T. Purcell, CFD and Transonic Helicopter Sound, 14th European Rotorcraft Forum, Paper 2, 1988.
 
13
 
14
R. Strawn, R. Biswas, and M. Garceau, Unstructured Adaptive Mesh Computations of Rotorcraft High-Speed Impulsive Noise, Journal of Aircraft, Vol. 32, pp. 754-760, 1995.
 
15
R. Van Driessche and D. Roose, Load Balancing Computational Fluid Dynamics Calculations on Unstructured Grids, AGARD, Report R-807, 1995.


Collaborative Colleagues:
Rupak Biswas: colleagues
Leonid Oliker: colleagues
Andrew Sohn: colleagues