A MULTIGRID CLUSTER LABELING SCHEME

被引：10

作者：

APOSTOLAKIS, J ^{[1
]}

CODDINGTON, P ^{[1
]}

MARINARI, E ^{[1
]}

机构：

[1] UNIV ROMA TOR VERGATA,DIPARTIMENTO FIS,I-00173 ROME,ITALY

来源：

EUROPHYSICS LETTERS | 1992年 / 17卷 / 03期

关键词：

COMPUTATIONAL TECHNIQUES; LATTICE THEORY AND STATISTICS; ISING PROBLEMS; GENERAL STUDIES OF PHASE TRANSITIONS;

D O I：

10.1209/0295-5075/17/3/001

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

We introduce a simple multi-scale algorithm for connected component labeling on parallel computers, which we apply to the problem of labeling clusters in spin and percolation models. We give numerical evidence that it is only logarithmically slowed down in the critical limit. We also discuss, in light of the proposed Teraflop computers optimized for lattice gauge theories and other lattice problems, the minimum requirements for computer switchboard architectures for which one can efficiently implement such multi-scale algorithms.

引用

页码：189 / 194

页数：6

共 26 条

[11]

HILLIS D, 1985, CONNECTION MACHINE

[12]

Horowitz E., 1978, FUNDAMENTALS COMPUTE

[13]

Iwasaki Y., 1990, Nuclear Physics B, Proceedings Supplements, V17, P259, DOI 10.1016/0920-5632(90)90249-T

[14] RIGOROUS LOWER BOUND ON THE DYNAMIC CRITICAL EXPONENT OF SOME MULTILEVEL SWENDSEN-WANG ALGORITHMS [J].

LI, XJ ;

SOKAL, AD .

PHYSICAL REVIEW LETTERS, 1991, 67 (12) :1482-1485

[15] RIGOROUS LOWER BOUND ON THE DYNAMIC CRITICAL EXPONENTS OF THE SWENDSEN-WANG ALGORITHM [J].

LI, XJ ;

SOKAL, AD .

PHYSICAL REVIEW LETTERS, 1989, 63 (08) :827-830

[16]

MARINARI E, UNPUB, P46401

[17] GEOMETRICAL PROPERTIES OF SWENDSEN-WANG CLUSTERS [J].

MIRANDA, EN .

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 1991, 175 (02) :229-234

[18]

Reingold E. M., 1977, COMBINATORIAL ALGORI

[19]

Rosenfeld A., 1982, DIGITAL PICTURE PROC, V2nd

[20]

RUSACK R, COMMUNICATION

← 1 2 3 →