Effective Monte Carlo simulation on System-V massively parallel associative string processing architecture
classification
⚛️ physics.comp-ph
cond-mat.stat-mechhep-lat
keywords
carlomonteprocessingstringalgorithmarchitectureassociativeeffective
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.