Parallelization of a cluster algorithm

Abstract We present two algorithms to parallelize the identification of clusters on a lattice. Such algorithms are necessary for a variety of problems such as percolation and non-local spin update algorithms. The algorithms were tested for the Swendsen-Wang method for the simulation of the Ising model. The tests were run on a multi-transputer system using up to 128 processors. A scaling law for the performance of geometric parallel algorithms is proposed and tested.

[1]  A. Cachon,et al.  Les Rayons Cosmiques , 1957 .

[2]  Wang,et al.  Nonuniversal critical dynamics in Monte Carlo simulations. , 1987, Physical review letters.

[3]  Michael Goldsmith,et al.  Programming in occam 2 , 1985, Prentice Hall international series in computer science.

[4]  S. Redner,et al.  Introduction To Percolation Theory , 2018 .

[5]  K. C. Bowler,et al.  An Introduction to OCCAM 2 Programming , 1989 .