Parallelization of Computational Physics Algorithms

Abstract

We report on the parallelization of two widely used algorithms in computational physics: The local-update Metropolis Monte Carlo simulation of the Ising model and a cluster identification algorithm which is used for percolation or percolation-like problems. The algorithm for the identification of clusters for the percolation-like problems was tested on the Swendsen-Wang method for the simulation of the Ising model. Simulation results are presented for a quench from a disordered state to a state below the coexistence curve. We show that the resulting domain growth has an exponential instead of a power law. The simulations were carried out on a parallel computer based on the transputer concept..