Vectorized cluster search

H.G. Evertz

doi:10.1016/0920-5632(92)90351-R

Vectorized cluster search

Publikation: Beitrag in einer Fachzeitschrift › Artikel

Abstract

Contrary to conventional wisdom, the construction of clusters on a lattice can easily be vectorized, namely over each “generation” in a breadth first search. This applies directly to e.g. the single cluster variant of the Swendsen-Wang algorithm. On a Cray-YMP, total CPU time was reduced by a factor 3.5 – 7 in actual applications.

Originalsprache	englisch
Seiten (von - bis)	620-622
Fachzeitschrift	Nuclear Physics B - Proceedings Supplements
Jahrgang	26
DOIs	https://doi.org/10.1016/0920-5632(92)90351-R
Publikationsstatus	Veröffentlicht - 1992
Extern publiziert	Ja

Zugriff auf Dokument

10.1016/0920-5632(92)90351-R

Andere Dateien und Links

http://www.scopus.com/inward/record.url?eid=2-s2.0-24544464813&partnerID=MN8TOARS

Dieses zitieren

@article{a18a326fbd2f4c8f805345c4ed773985,

title = "Vectorized cluster search",

abstract = "Contrary to conventional wisdom, the construction of clusters on a lattice can easily be vectorized, namely over each “generation” in a breadth first search. This applies directly to e.g. the single cluster variant of the Swendsen-Wang algorithm. On a Cray-YMP, total CPU time was reduced by a factor 3.5 – 7 in actual applications.",

author = "H.G. Evertz",

year = "1992",

doi = "10.1016/0920-5632(92)90351-R",

language = "English",

volume = "26",

pages = "620--622",

journal = "Nuclear Physics B - Proceedings Supplements",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Vectorized cluster search

AU - Evertz, H.G.

PY - 1992

Y1 - 1992

N2 - Contrary to conventional wisdom, the construction of clusters on a lattice can easily be vectorized, namely over each “generation” in a breadth first search. This applies directly to e.g. the single cluster variant of the Swendsen-Wang algorithm. On a Cray-YMP, total CPU time was reduced by a factor 3.5 – 7 in actual applications.

AB - Contrary to conventional wisdom, the construction of clusters on a lattice can easily be vectorized, namely over each “generation” in a breadth first search. This applies directly to e.g. the single cluster variant of the Swendsen-Wang algorithm. On a Cray-YMP, total CPU time was reduced by a factor 3.5 – 7 in actual applications.

UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-24544464813&partnerID=MN8TOARS

U2 - 10.1016/0920-5632(92)90351-R

DO - 10.1016/0920-5632(92)90351-R

M3 - Article

VL - 26

SP - 620

EP - 622

JO - Nuclear Physics B - Proceedings Supplements

JF - Nuclear Physics B - Proceedings Supplements

ER -

Vectorized cluster search

Abstract

Zugriff auf Dokument

Andere Dateien und Links

Fingerprint

Dieses zitieren