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 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.