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.
Original language | English |
---|---|
Pages (from-to) | 620-622 |
Journal | Nuclear Physics B - Proceedings Supplements |
Volume | 26 |
DOIs | |
Publication status | Published - 1992 |
Externally published | Yes |