The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (1997 vol.8)
pp: 1089-1097
ABSTRACT
<p><b>Abstract</b>—The cluster identification problem is a variant of connected component labeling that arises in cluster algorithms for spin models in statistical physics. We present a multidimensional version of Belkhale and Banerjee's Quad algorithm for connected component labeling on distributed memory parallel computers. Our extension abstracts away extraneous spatial connectivity information in more than two dimensions, simplifying implementation for higher dimensionality. We identify two types of locality present in cluster configurations, and present optimizations to exploit locality for better performance. Performance results from 2D, 3D, and 4D Ising model simulations with Swendson-Wang dynamics show that the optimizations improve performance by 20-80 percent.</p>
INDEX TERMS
Cluster identification, Ising model, connected component labeling, parallel algorithm, Swendson-Wang dynamics.
CITATION
Stephen J. Fink, Craig Huston, Scott B. Baden, Karl Jansen, "Parallel Cluster Identification for Multidimensional Lattices", IEEE Transactions on Parallel & Distributed Systems, vol.8, no. 11, pp. 1089-1097, November 1997, doi:10.1109/71.642944
22 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool