オーダリングによるEBEデータ並列有限要素法の効率化
スポンサーリンク
概要
- 論文の詳細を見る
This study aims to develop a partitioning algorithm for data parallel computation. The greedy partitioning algorithm for the message passing developed by Farhat was modified for the data parallel computation of an element-by-element finite element method. The influence of the numbering of nodes and elements onto the parallel efficiency is examined through the parallel computations using CRAY-T 3 D. It was shown that the proposed partitioning algorithm considering the ordering of nodes and elements for data parallel computation can save time of solving problems and will improve the efficiency of parallelism. In the case of CRAY-T 3 D with 128 PEs, the maximum number of communications of the cyclic ordering version in the flow inside a subway station model with about 1 410 000 elements is 89% smaller than the original one. The rate of CPU usage of the cyclic ordering version is 92%.
- 一般社団法人日本機械学会の論文
- 1999-12-25
著者
関連論文
- 並列化コンパイラHPF/ESの不規則問題向け機能
- 有限要素法におけるMPIとマイクロタスキングのハイブリッド並列処理
- 134 流体・構造連成解析の MPI/OpenMP ハイブリッド並列有限要素解析
- 非圧縮性熱流体-弾性構造物の統一的連成解析手法
- オーダリングによるEBEデータ並列有限要素法の効率化
- 超並列有限要素法のための Partitioning アルゴリズムの開発