Vectorized Cluster Search
classification
✦ hep-lat
keywords
clustersearchvectorizedactualalgorithmapplicationsappliesbreadth
read the original 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 {\it single cluster} variant of the Swendsen-Wang algorithm. On a Cray Y-MP, total CPU time was reduced by a factor 3.5 -- 7 in actual applications.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.