A fast method to gather neighbors in vectorized Monte Carlo simulations

✍ Scribed by Claus Vohwinkel

• Publisher: Elsevier Science
• Year: 1988
• Tongue: English
• Weight: 429 KB
• Volume: 51
• Category: Article
• ISSN: 0010-4655
• DOI: 10.1016/0010-4655(88)90145-2

✦ Synopsis

An algorithm is presented, which gathers neighbors for n-dimensional lattices with periodic boundary conditions. The method used does not need the usual GATHER instructions. With the exception of a few bit-vectors no additional storage is needed. The algorithm can be easily extended to more than nearest neighbor interactions. In a simulation of SU(3) lattice gauge theory on a 2-pipe CDC CYBER 205, using 32-bit arithmetic, the time spent on gathering neighboring links is reduced from 5.7 ~s to 1.3 ~is per link per update, and an update time of 17 is per link is obtained.