.png){kind=icon}
.png){kind=icon}
Return
Parallel dynamic graph partitioning for adaptive unstructured meshes
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.1997.1407.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
graph-partitioning
adaptive unstructured meshes
load-balancing
parallel computing
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available