The Community for Technology Leaders
Proceedings 15th Workshop on Parallel and Distributed Simulation (2001)
Lake Arrowhead, California
May 15, 2001 to May 18, 2001
ISSN: 1087-4097
ISBN: 0-7695-1104-X
pp: 185
Boris Lubachevsky , Bell Labs
Alan Weiss , Bell Labs
A new parallel algorithm for simulating Ising spin systems is presented. The sequential prototype is the n-fold way algorithm [2], which is efficient but is hard to parallelize using conservative methods. Our parallel algorithm is optimistic. Unlike other optimistic algorithms, e.g., Time Warp, our algorithm is synchronous. It also belongs to the class of simulations known as "relaxation" [3]; hence it is named "synchronous relaxation." We derive performance guarantees for this algorithm. If N is the number of PEs, then under weak assumptions we show that the number of correct events processed per unit of time is, on average, at least of order N=log N. All communication delays, processing time, and busy waits are taken into account.
conservative simulation, optimistic simulation, computational physics, Metropolis algorithm.

A. Weiss and B. Lubachevsky, "Synchronous Relaxation For Parallel Ising Spin Simulations," Proceedings 15th Workshop on Parallel and Distributed Simulation(PADS), Lake Arrowhead, California, 2001, pp. 185.
96 ms
(Ver 3.3 (11022016))