A domain decomposition method based on the AD algorithm

DOI

10.2991/meic-14.2014.358How to use a DOI?

Keywords

domain decomposition; parallel computing; AD algorithm; unstructured grid

Abstract

We first establish the relationship between the grid cell connectivity matrix bandwidth and the efficiency of parallel computing, which shows that parallel efficiency can be improved by reducing the bandwidth so that the external communication is reduced. An algorithm based on the AD algorithm is developed which can reduce the connectivity matrix bandwidth, so that parallel efficiency can be improved. The purposed algorithm uses cell ponderation to relabel cell labels. A domain decomposition method is then developed based on the new algorithm. Parts of unstructured grid of global ocean are researched based on the developed domain decomposition method. The investigation shows that our method has feasibility and effectiveness for domain decomposition of large-scale grids since the speedup and efficiency are obtained from our method.

Copyright

© 2014, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Ruyun Wang
AU  - Yingxian Yu
AU  - Zhen-tao Zang
AU  - Di Cao
AU  - Qing Fang
PY  - 2014/11
DA  - 2014/11
TI  - A domain decomposition method based on the AD algorithm
BT  - Proceedings of the 2014 International Conference on Mechatronics, Electronic, Industrial and Control Engineering
PB  - Atlantis Press
SP  - 1589
EP  - 1594
SN  - 2352-5401
UR  - https://doi.org/10.2991/meic-14.2014.358
DO  - 10.2991/meic-14.2014.358
ID  - Wang2014/11
ER  -