Efficient parallel algorithms for 2-dimensional ising spin models

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

doi:10.1109/IPDPS.2002.1016660

Efficient parallel algorithms for 2-dimensional ising spin models

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

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	238
Number of pages	1
ISBN (Electronic)	0769515738, 9780769515731
DOIs	https://doi.org/10.1109/IPDPS.2002.1016660
State	Published - Jan 1 2002
Externally published	Yes
Event	16th International Parallel and Distributed Processing Symposium, IPDPS 2002 - Ft. Lauderdale, United States Duration: Apr 15 2002 → Apr 19 2002

Publication series

Name	Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002

Other

Other	16th International Parallel and Distributed Processing Symposium, IPDPS 2002
Country/Territory	United States
City	Ft. Lauderdale
Period	4/15/02 → 4/19/02

ASJC Scopus subject areas

Computer Networks and Communications
Modeling and Simulation

Online availability

10.1109/IPDPS.2002.1016660

Library availability

Discover UIUC Full Text

Cite this

Santos, E. E., Feng, S., & Rickman, J. M. (2002). Efficient parallel algorithms for 2-dimensional ising spin models. In Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002 (pp. 238). [1016660] (Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IPDPS.2002.1016660

Efficient parallel algorithms for 2-dimensional ising spin models. / Santos, E. E.; Feng, Shuangtong; Rickman, J. M.

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002. Institute of Electrical and Electronics Engineers Inc., 2002. p. 238 1016660 (Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Santos, EE, Feng, S & Rickman, JM 2002, Efficient parallel algorithms for 2-dimensional ising spin models. in Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002., 1016660, Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002, Institute of Electrical and Electronics Engineers Inc., pp. 238, 16th International Parallel and Distributed Processing Symposium, IPDPS 2002, Ft. Lauderdale, United States, 4/15/02. https://doi.org/10.1109/IPDPS.2002.1016660

Santos EE, Feng S, Rickman JM. Efficient parallel algorithms for 2-dimensional ising spin models. In Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002. Institute of Electrical and Electronics Engineers Inc. 2002. p. 238. 1016660. (Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002). https://doi.org/10.1109/IPDPS.2002.1016660

@inproceedings{4273d4cf55f64d1eab73c0499c7db439,

title = "Efficient parallel algorithms for 2-dimensional ising spin models",

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.",

author = "Santos, {E. E.} and Shuangtong Feng and Rickman, {J. M.}",

note = "Funding Information: Research partially supported by an NSF CAREER Grant. Research partially supported by NSF grant CCR-9624721. Publisher Copyright: {\textcopyright} 2002 IEEE.; 16th International Parallel and Distributed Processing Symposium, IPDPS 2002 ; Conference date: 15-04-2002 Through 19-04-2002",

year = "2002",

month = jan,

day = "1",

doi = "10.1109/IPDPS.2002.1016660",

language = "English (US)",

series = "Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "238",

booktitle = "Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002",

address = "United States",

}

TY - GEN

T1 - Efficient parallel algorithms for 2-dimensional ising spin models

AU - Santos, E. E.

AU - Feng, Shuangtong

AU - Rickman, J. M.

PY - 2002/1/1

Y1 - 2002/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84966593360&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84966593360&partnerID=8YFLogxK

U2 - 10.1109/IPDPS.2002.1016660

DO - 10.1109/IPDPS.2002.1016660

M3 - Conference contribution

AN - SCOPUS:84966593360

T3 - Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002

SP - 238

BT - Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 16th International Parallel and Distributed Processing Symposium, IPDPS 2002

Y2 - 15 April 2002 through 19 April 2002

ER -

Efficient parallel algorithms for 2-dimensional ising spin models

Abstract

Publication series

Other

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this