Vectorized cluster search

1991/12/31 by Hans Gerd Evertz, H.G. Evertz
Computer Science · Physics and Astronomy · #Advanced Clustering Algorithms Research #Algorithms and Data Compression #Distributed and Parallel Computing Systems #hep-lat

paper · pdf · doi:10.1016/0920-5632(92)90351-r

published as Nucl.Phys.Proc.Suppl. 26 (1992) 620-622

openalex publication_date 1992/01/01 · arxiv created 1992/04/08 · arxiv updated 2009/11/30 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

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.

Related

• The k-means-u* algorithm: non-local jumps and greedy retries improve k-means++ clustering
• Why does Greedy Search produce Optimal Clustering Outcomes? A Fixed-Core Assignment Theory
• Sketching semidefinite programs for faster clustering
• Fixed-sized clusters k-Means
• Note to "An efficient Data Structure for Lattice Operation"