A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is
Proceedings of the Fifth Distributed Memory Computing Conference, 1990.
Parallel computers are ideally suited to the Monte Carlo simulation of spin models using the standard Metropolis algorithm, since it is regular and local. However local algorithms have the major drawback that near a phase transition the number of sweeps needed to generate a statistically independent configuration increases as the square of the lattice size. New algorithms have recently been developed which dramatically reduce this 'critical slowing down' by updating clusters of spins at a time.doi:10.1109/dmcc.1990.555410 fatcat:fecbbyhtcnagtmhnwcpjgm4jh4