Monte Carlo parallel algorithm for long range interactions

Abstract We show the use of the homogenous architecture in the parallel processing of long range interactions. We describe the implementation of a Monte Carlo algorithm for a two-dimensional Coulomb system on a parallel processor with hypercubic geometry (the 8-node concurrent processor at Caltech). Our results indicate that long range problems can be efficiently implemented on parallel machines.