Effective Monte Carlo simulation on System-V massively parallel associative string processing architecture

Abstract

We show that the latest version of massively parallel processing associative string processing architecture (System-V) is applicable for fast Monte Carlo simulation if an effective on-processor random number generator is implemented. Our lagged Fibonacci generator can produce $10^8$ random numbers on a processor string of 12K PE-s. The time dependent Monte Carlo algorithm of the one-dimensional non-equilibrium kinetic Ising model performs 80 faster than the corresponding serial algorithm on a 300 MHz UltraSparc.

8 pages, 9 color ps figures embedded

References in corpus (2)

• Roughening transition in a model for dimer adsorption and desorption
• Critical behavior of roughening transitions in parity-conserving growth processes

Cited by in corpus (1)

• Nonequilibrium Critical Phenomena and Phase Transitions into Absorbing States