arXiv · hep-lat/9112001
Vectorized Cluster Search
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Hans Gerd Evertz. 1992-04-08. Vectorized Cluster Search. https://doi.org/10.1016/0920-5632(92)90351-r
Cite the original work for its findings. Save a collection to share your selection of sources.