DMCA
Dynamic Load Balancing for Parallel Adaptive Mesh Refinement (1998)
| Venue: | In 5th International Symposium on Solving Irregularly Structured Problems in Parallel |
| Citations: | 9 - 5 self |
BibTeX
@INPROCEEDINGS{Li98dynamicload,
author = {Xiang-yang Li and Shang-Hua Teng},
title = {Dynamic Load Balancing for Parallel Adaptive Mesh Refinement},
booktitle = {In 5th International Symposium on Solving Irregularly Structured Problems in Parallel},
year = {1998},
pages = {144--155},
publisher = {Springer-Verlag, LNCS}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Adaptive mesh refinement is a key problem in large-scale numerical calculations. The need of adaptive mesh refinement could introduce load imbalance among processors, where the load measures the amount of work required by refinement itself as well as by numerical calculations thereafter. We present a dynamic load balancing algorithm to ensure that the work load are balanced while the communication overhead is minimized. The main ingredient of our method is a technique for the estimation of the size and the element distribution of the refined mesh before we actually generate the refined mesh. Base on this estimation, we can reduce the dynamic load balancing problem to a collection of static partitioning problems, one for each processor. In parallel each processor could then locally apply a static partitioning algorithm to generate the basic units of submeshes for load rebalancing. We then model the communication cost of moving submeshes by a condensed and much smaller subdomain graph,...
Keyphrases
parallel adaptive mesh refinement dynamic load balancing dynamic load adaptive mesh refinement numerical calculation refined mesh communication overhead basic unit key problem large-scale numerical calculation main ingredient work load communication cost load rebalancing subdomain graph load imbalance element distribution static partitioning algorithm static partitioning problem
