Vectorized Cluster Search
High Energy Physics - Lattice
2007-05-23 v1
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.
Cite
@article{arxiv.hep-lat/9112001,
title = {Vectorized Cluster Search},
author = {Hans Gerd Evertz},
journal= {arXiv preprint arXiv:hep-lat/9112001},
year = {2007}
}