Efficient simulation based on sweep selection for 2-D and 3-D Ising spin models on hierarchical clusters

Santos, Eunice E.; Muthukrishnan, G.

doi:10.1109/ipdps.2004.1303272

Cited by 5 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several studies have considered parallelizing MC simulations using DD methods [3,13,17,21,29]. MC simulations for the Ising model, which uses only nearest-neighbors interactions (6-point stencil in 3 dimensions), have been successfully implemented on shared-memory systems with checker-board algorithms.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Domain Decomposition vs. Master-Slave in Apparently Homogeneous Systems

Banino-Rokkones

2007

2007 IEEE International Parallel and Distributed Processing Symposium

View full text Add to dashboard Cite

show abstract

Section: Related Workmentioning

confidence: 99%

“…Santos et al [28,29] conducted research on MC simulations for 2D and 3D Ising models in another direction. Each local domain is partitioned into different sets, that are updated one after another, in alternation with communication events.…”

Section: Related Workmentioning

confidence: 99%

Domain Decomposition vs. Master-Slave in Apparently Homogeneous Systems

Banino-Rokkones

2007

2007 IEEE International Parallel and Distributed Processing Symposium

View full text Add to dashboard Cite

show abstract

“…Proofs and full discussion of algorithms can be found in [18]. Simulation of spin systems on hierarchical clusters have been presented in [20].…”

Section: Introductionmentioning

confidence: 99%

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

et al. 2008

View full text Add to dashboard Cite

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.

show abstract