Efficient parallel algorithms for 2-dimensional ising spin models

E. E. Santos, Shuangtong Feng, J. M. Rickman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 run-time 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 regards 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 provided comparisons between the different schemes.

Original languageEnglish (US)
Title of host publicationProceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages238
Number of pages1
ISBN (Electronic)0769515738, 9780769515731
DOIs
StatePublished - Jan 1 2002
Externally publishedYes
Event16th International Parallel and Distributed Processing Symposium, IPDPS 2002 - Ft. Lauderdale, United States
Duration: Apr 15 2002Apr 19 2002

Publication series

NameProceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002

Other

Other16th International Parallel and Distributed Processing Symposium, IPDPS 2002
CountryUnited States
CityFt. Lauderdale
Period4/15/024/19/02

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Modeling and Simulation

Fingerprint Dive into the research topics of 'Efficient parallel algorithms for 2-dimensional ising spin models'. Together they form a unique fingerprint.

Cite this