DMCA
Performance of Dynamic Load Balancing Algorithms for Unstructured Mesh Calculations (1991)
Cached
Download Links
- [www.cacr.caltech.edu]
- [www.cacr.caltech.edu]
- [cacs.usc.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | Concurrency |
| Citations: | 174 - 3 self |
BibTeX
@ARTICLE{Williams91performanceof,
author = {Roy Williams},
title = {Performance of Dynamic Load Balancing Algorithms for Unstructured Mesh Calculations},
journal = {Concurrency},
year = {1991},
volume = {3},
pages = {457--481}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
If a finite element mesh has a sufficiently regular structure, it is easy to decide in advance how to distribute the mesh among the processors of a distributed-memory parallel processor, but if the mesh is unstructured, the problem becomes much more difficult. The distribution should be made so that each processor has approximately equal work to do, and such that communication overhead is minimized. If the mesh is solution-adaptive, i.e. the mesh and hence the load balancing problem change discretely during execution of the code, then it is most efficient to decide the optimal mesh distribution in parallel. In this paper three parallel algorithms, Orthogonal Recursive Bisection (ORB), Eigenvector Recursive Bisection (ERB) and a simple parallelization of Simulated Annealing (SA) have been implemented for load balancing a dynamic unstructured triangular mesh on 16 processors of an NCUBE machine. The test problem is a solution-adaptive Laplace solver, with an initial mesh of 280 elements,...
Keyphrases
unstructured mesh calculation dynamic load balancing algorithm simulated annealing simple parallelization parallel algorithm communication overhead equal work solution-adaptive laplace solver regular structure orthogonal recursive bisection optimal mesh distribution ncube machine eigenvector recursive bisection dynamic unstructured triangular mesh initial mesh finite element mesh distributed-memory parallel processor load balancing problem change test problem
