Abstract
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 α-scheme. We analyze randomness of our schemes using statistical methods and provide comparisons between the different schemes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Amar JG (2006) The Monte Carlo method in science and engineering. Comput Sci Eng 8(2):9–19
Chaikin PM, Lubensky TC (1995) Principles of condensed matter physics. Cambridge University Press, New York
Binder K (1979) Introduction: theory and ‘technical’ aspects of Monte Carlo simulations. In: Binder K (ed) Monte Carlo methods in statistical physics. Springer, New York
Gunton JD, Droz M (1983) Introduction to the theory of metastable and unstable states. Springer, New York
Blote HWJ, Heringa JR, Luijten E (2002) Cluster Monte Carlo: extending the range. Comput Phys Commun 147:58
Binney JJ, Dowrick NJ, Fisher AJ, Newman MEJ (1992) The theory of critical phenomena: an introduction to the renormalization group. Clarendon, Oxford
Pathria RK (1972) Statistical mechanics. Pergamon, New York
Bortz AB, Kalos MH, Lebowitz JL (1975) J Comput Phys 17:10
Culler DE, Karp RM, Patterson DA, Sahay A, Santos EE, Schauser KE, Subramonian R, von Eicken T (1996) LogP: A practical model of parallel computation. Commun ACM 37(11):78–85
Forster D (1975) Hydrodynamics fluctuations, broken symmetry and correlation functions. Benjamin, Elmsford
Heermann DW, Burkitt AN (1991) Parallel algorithms in computational science. Springer, Berlin
Ising E (1925) Z Phys 31:253
Iwashitaa T, Uragamia K, Shimizua A, Nagakia A, Kasamab T, Idogakib T (2007) Magnetic properties and spin structure on Ising spin system with two-spin and four-spin interactions. J Magn Magn Mater 310(2):e435–e437
Karp RM, Sahay A, Santos EE, Schauser KE (1993) Optimal broadcast and summation in the LogP model. In: Proceedings of the 5th annual ACM symposium on parallel algorithms and architectures
Lubachevsky BD, Weiss A (2004) Synchronous relaxation for parallel Ising spin simulations. In: CoRR. cs.DC/0405053
Metropolis N, Rosenbluth AW (1953) Equation of state calculations by fast computing machines. J Chem Phys 21:1087–1092
Santos EE (1999) Optimal and near-optimal algorithms for k-item broadcast. J Parallel Distrib Comput 57(2):121–139
Santos EE, Rickman JM, Muthukrishnan G, Feng S (2003) Efficient algorithms for parallelizing Monte Carlo simulations for 2D Ising spin models. Technical Report LCID-03-105, Laboratory for Computation, Information & Distributed Processing, Virginia Polytechnic Institute & State University
Santos EE, Feng S, Rickman JM (2002) Efficient parallel algorithms for 2-dimensional Ising spin models. In: Proc. IPDPS
Santos EE, Muthukrishnan G (2004) Efficient simulation based on sweep selection for 2D and 3D Ising spin models on hierarchical clusters. In: Proc. IPDPS
Wang J-S, Swendsen RH (1990) Cluster Monte Carlo algorithms. Physica A 167:565–679
Wolf U (1989) Collective Monte Carlo updating for spin systems. Phys Rev Lett 62:361–364
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Santos, E.E., Rickman, J.M., Muthukrishnan, G. et al. Efficient algorithms for parallelizing Monte Carlo simulations for 2D Ising spin models. J Supercomput 44, 274–290 (2008). https://doi.org/10.1007/s11227-007-0163-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-007-0163-z