A direct parallel implementation of the Koshen-Kopelman algorithm for distributed memory architectures

被引:11
作者
Teuler, JM
Gimel, JC
机构
[1] Inst Dev & Ressources Informat Sci, CNRS, F-91403 Orsay, France
[2] Univ Maine, CNRS, F-72085 Le Mans 9, France
关键词
percolation; parallel computing;
D O I
10.1016/S0010-4655(00)00046-1
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We present a direct (i.e. non iterative) method for identifying the clusters of a cubic lattice on a distributed memory parallel machine. We describe the various cluster properties which we were able to compute with this method. Finally, we give some performance measurements. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:118 / 129
页数:12
相关论文
共 12 条
[11]  
SRINIVASAN A, 1999, ADV CHEM PHYSICS, V105
[12]  
Stauffer D., 1992, INTRO PERCOLATION TH, V2nd