Synchronous Relaxation for Parallel Ising Spin Simulations
Boris Lubachevsky, Alan Weiss
Abstract
A new parallel algorithm for simulating Ising spin systems is presented. The sequential prototype is the n-fold way algorithm citeBKL75, 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'' citeCS8 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.
Create a lesson
Related papers
flash-comm: Self-Synchronizing Collective Communication for LLM Decoding
Carrie Wang, Jack Li, Jason Zhao
AtomicFaaS: Offloading Side-Effect Compensation to the Serverless Platform
Jonas Heisterberg, Sebastian Koch, Trever Schirmer et al.
Optimal Subcubic Byzantine Agreement with Plain PKI
Marc Dufay, Roger Wattenhofer
Weaver: Unlocking Blockchain Transaction Parallelism through State-Decoupled Symbolic Execution
Ru Cheng, Maofan Yin, Liangrong Chen et al.
Performance Portability of Out-of-Kernel Optimizations on GPUs: A Molecular Docking Case Study
Gianmarco Accordi, Leonardo Beltrame, Theresa Pollinger et al.
Chiron: Cache Management Empowered by LLM Intelligence for AI Workloads
Bohan Zhang, Renshu Ge, Tianze Wang et al.