PARALLEL WOLFF CLUSTER ALGORITHMS

S. Bae, S.H. Ko and P.D. Coddington
Additional contact information
S. Bae: School of Computer Science, Syracuse University 111 College Place, Syracuse, NY 13244, USA
S.H. Ko: School of Computer Science, Syracuse University 111 College Place, Syracuse, NY 13244, USA
P.D. Coddington: Northeast Parallel Architectures Center, Syracuse University 111 College Place, Syracuse, NY 13244, USA

International Journal of Modern Physics C (IJMPC), 1995, vol. 06, issue 02, 197-210

Abstract: The Wolff single-cluster algorithm is the most efficient method known for Monte Carlo simulation of many spin models. Due to the irregular size, shape and position of the Wolff clusters, this method does not easily lend itself to efficient parallel implementation, so that simulations using this method have thus far been confined to workstations and vector machines. Here we present two parallel implementations of this algorithm, and show that one gives fairly good performance on a MIMD parallel computer.

Keywords: Monte Carlo; Spin Models; Cluster Algorithms; Wolff Algorithm; Parallel Algorithms (search for similar items in EconPapers)
Date: 1995
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183195000150
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:06:y:1995:i:02:n:s0129183195000150

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183195000150

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 ().