NEW SIMD ALGORITHMS FOR CLUSTER LABELING ON PARALLEL COMPUTERS

John Apostolakis, Paul Coddington and Enzo Marinari
Additional contact information
John Apostolakis: Physics Department, Syracuse University, Syracuse, NY 13244, USA
Paul Coddington: Physics Department, Syracuse University, Syracuse, NY 13244, USA
Enzo Marinari: Physics Department, Syracuse University, Syracuse, NY 13244, USA

International Journal of Modern Physics C (IJMPC), 1993, vol. 04, issue 04, 749-763

Abstract: Cluster algorithms are non-local Monte Carlo update schemes which can greatly increase the efficiency of computer simulations of spin models of magnets. The major computational task in these algorithms is connected component labeling, to identify clusters of connected sites on a lattice. We have devised some new SIMD component labeling algorithms, and implemented them on the Connection Machine. We investigate their performance when applied to the cluster update of the two-dimensional Ising spin model. These algorithms could also be applied to other problems which use connected component labeling, such as percolation and image analysis.

Date: 1993
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183193000628
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:04:y:1993:i:04:n:s0129183193000628

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183193000628

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().