cs.ARNov 18, 2026

Accelerating Distributed Digital Ising Machines

Authors: Tong Wu, Ziyad Alswaidan, Shreya Mukherjee, Ting-Yu Lee, Daniel Xu, Atharva Raut, Harry Tye, Abhinav K. Puthran, 

Organizations: Carnegie Mellon University · University of Pittsburgh · University of California, Santa Barbara

Abstract

Ising machines, dedicated accelerators built around the dynamics of Ising-like spin models, have emerged as a leading platform for combinatorial optimization and probabilistic sampling. The problems that motivate them require millions of spins, far beyond the on-chip capacity of any single device, so a practical Ising machine must distribute its computation across many devices. Prior work reports throughput at a single operating point, leaving the binding resource unidentified and platform crossovers measurable only by experiment; no calibrated cross-platform cost model of distributed Ising machines has been reported, nor have systematic techniques to accelerate their Markov chain Monte Carlo (MCMC) workloads. This work presents a calibrated cost model that decomposes digital Ising sweep time into compute, memory, synchronization, and inter-device communication terms, validated with 4.8% mean error across three GPU generations, FPGA and ASIC up to 1 million spins. Guided by the model, we address each term in turn and propose: (i) a data placement strategy, worth up to 4.2×\times speedup; (ii) multi-rate and bounded-staleness schedules that relax the barrier that Gibbs sampling imposes, cutting time-to-solution (TTS) by up to 3.16×\times on three benchmarks; and (iii) a phase-offset streaming dataflow that hides boundary exchange behind interior computation whenever a link satisfies a latency-transparency criterion, yielding up to 1.25×\times/1.74×\times/2.01×\times on an H200 pair, a ZCU106 pair, and a four-board XEM8320 2×22{\times}2 mesh. The streaming dataflow is also implemented on a fabricated four-chip 28 nm ASIC sustaining 28.1 Gflips/s at 4.81 pJ/flip.

Figures & tables

Explore similar work

CardsList
  1. A fully parallel densely connected probabilistic Ising machine with inertia for real-time applications

    Apr 18, 2026Ruomin Zhu, Abhishek Kumar Singh, Jérémie Laydevant +5Ising Optimization

  2. Probabilistic Algorithms for Ising Machines from Optimization to Generative AI

    Oct 2, 2026Corentin Delacour, Xiuqi Zhang, Abdelrahman S. Abdelrahman +4Stochastic OptimizationMetaheuristic Optimization

  3. Beyond Gradient Descent: Adam for Analog Ising Machines

    Jun 2, 2026Stijn Van Vooren, Guy Van der Sande, Guy VerschaffeltCombinatorial OptimizationAdaptive Gradient Methods