Logo image
Back
Efficient algorithms for parallelizing Monte Carlo simulations for 2D Ising spin models
Journal article   Peer reviewed

Efficient algorithms for parallelizing Monte Carlo simulations for 2D Ising spin models

Eunice E. Santos, Jeffrey M. Rickman, Gayathri Muthukrishnan and Shuangtong Feng
The Journal of supercomputing, v 44(3), pp 274-290
01 Jun 2008
DOI: https://doi.org/10.1007/s11227-007-0163-z

Abstract

Computer Science, Hardware & Architecture Computer Science, Theory & Methods Engineering, Electrical & Electronic Science & Technology Computer Science Engineering Technology
In this paper, we design and implement a variety of parallel algorithms for both sweep spin selection and random spin selection. We analyze our parallel algorithms on LogP, a portable and general parallel machine model. We then obtain rigorous theoretical runtime results on LogP for all the parallel algorithms. Moreover, a guiding equation is derived for choosing data layouts (blocked vs. stripped) for sweep spin selection. In regard to random spin selection, we are able to develop parallel algorithms with efficient communication schemes. We introduce two novel schemes, namely the FML scheme and the alpha-scheme. We analyze randomness of our schemes using statistical methods and provide comparisons between the different schemes.

Metrics

1 Record Views
2 citations in Web of Science

Details

Logo image