Two Parallel Swendsen-Wang Cluster Algorithms Using Message-Passing Paradigm

Simple item page
dc.creatorLin, Shizeng
dc.creatorZheng, Bo
dc.date2008-08-15
dc.date2008-08-16
dc.date.accessioned2026-07-07T09:56:53Z
dc.date.available2026-07-07T09:56:53Z
dc.descriptionIn this article, we present two different parallel Swendsen-Wang Cluster(SWC) algorithms using message-passing interface(MPI). One is based on Master-Slave Parallel Model(MSPM) and the other is based on Data-Parallel Model(DPM). A speedup of 24 with 40 processors and 16 with 37 processors is achieved with the DPM and MSPM respectively. The speedup of both algorithms at different temperature and system size is carefully examined both experimentally and theoretically, and a comparison of their efficiency is made. In the last section, based on these two parallel SWC algorithms, two parallel probability changing cluster(PCC) algorithms are proposed.
dc.description7 pages and 5 figures
dc.identifierhttps://arxiv.org/abs/0808.2109
dc.identifierhttp://arxiv.org/abs/0808.2109
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/167141
dc.subjectComputational Physics
dc.titleTwo Parallel Swendsen-Wang Cluster Algorithms Using Message-Passing Paradigm
dc.typetext

Files

Collections

arXiv