.png){kind=icon}
返回
Parallel dynamic graph partitioning for adaptive unstructured meshes
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.1997.1407.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A parallel method for the dynamic partitioning of unstructured meshes is described. The method introduces a new iterative optimization technique known as relative gain optimization which both balances the workload and attempts to minimize the interprocessor communications overhead. Experiments on a series of adaptively refined meshes indicate that the algorithm provides partitions of an equivalent or higher quality to static partitioners (which do not reuse the existing partition) and much more rapidly, Perhaps more importantly, the algorithm results in only a small fraction of the amount of data migration compared to the static partitioners. (C) 1997 Academic Press.
Keyword:
graph-partitioning
adaptive unstructured meshes
load-balancing
parallel computing
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
.png){kind=icon}
PREPARATION OF Au-LOADED TiO2 BY PHOTOCHEMICAL DEPOSITION AND OZONE PHOTOCATALYTIC DECOMPOSITION
PREAI
分享收藏
Effects of Selective Adaptation on the Perception of Speech and Visual Patterns: Evidence for Feature Detectors选择性适应对语音和视觉模式感知的影响: 特征检测器的证据
PREAI
分享收藏
分享收藏
查看更多内容