NPAC Technical Report SCCS-619
Parallel Wolff Cluster Algorithms
S-J Bae, Paul Coddington, S-H Ko
Submitted March 28 1994
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.