Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2004-05-17
15th Workshop on Parallel and Distributed Simulation, Lake Arrowhead, California, May 2001, pp.185-192
Computer Science
Distributed, Parallel, and Cluster Computing
Extended abstract. Conference version. The full paper in preparation
Scientific paper
A new parallel algorithm for simulating Ising spin systems is presented. The sequential prototype is the n-fold way algorithm cite{BKL75}, 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'' cite{CS8 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.
Lubachevsky Boris
Weiss Alexander
No associations
LandOfFree
Synchronous Relaxation for Parallel Ising Spin Simulations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Synchronous Relaxation for Parallel Ising Spin Simulations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Synchronous Relaxation for Parallel Ising Spin Simulations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-284750