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 | |
Publikationsstatus | Veröffentlicht - 1992 |
Extern publiziert | Ja |