Vectorized cluster search

Research output: Contribution to journalArticle


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.
Original languageEnglish
Pages (from-to)620-622
JournalNuclear Physics B - Proceedings Supplements
Publication statusPublished - 1992
Externally publishedYes


Dive into the research topics of 'Vectorized cluster search'. Together they form a unique fingerprint.

Cite this