Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.22631 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912400206200832 |
|---|---|
| author | Gonul, Yilmaz Ege Kayan, Ceyhun Efe Mustafazade, Ilknur Kandasamy, Nagarajan Taskin, Baris |
| author_facet | Gonul, Yilmaz Ege Kayan, Ceyhun Efe Mustafazade, Ilknur Kandasamy, Nagarajan Taskin, Baris |
| contents | Oscillator-based Ising machines (OIMs) and oscillator-based Potts machines (OPMs) have emerged as promising hardware accelerators for solving NP-hard combinatorial optimization problems by leveraging the phase dynamics of coupled oscillators. In this work, a GPU-accelerated simulated OIM/OPM digital computation framework capable of solving combinatorial optimization problems is presented. The proposed implementation harnesses the parallel processing capabilities of GPUs to simulate large-scale OIM/OPMs, leveraging the advantages of digital computing to offer high precision, programmability, and scalability. The performance of the proposed GPU framework is evaluated on the max-cut problems from the GSET benchmark dataset and graph coloring problems from the SATLIB benchmarks dataset, demonstrating competitive speed and accuracy in tackling large-scale problems. The results from simulations, reaching up to 11295x speed-up over CPUs with up to 99% accuracy, establish this framework as a scalable, massively parallelized, and high-fidelity digital realization of OIM/OPMs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_22631 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | GPU-Accelerated Simulated Oscillator Ising/Potts Machine Solving Combinatorial Optimization Problems Gonul, Yilmaz Ege Kayan, Ceyhun Efe Mustafazade, Ilknur Kandasamy, Nagarajan Taskin, Baris Hardware Architecture Oscillator-based Ising machines (OIMs) and oscillator-based Potts machines (OPMs) have emerged as promising hardware accelerators for solving NP-hard combinatorial optimization problems by leveraging the phase dynamics of coupled oscillators. In this work, a GPU-accelerated simulated OIM/OPM digital computation framework capable of solving combinatorial optimization problems is presented. The proposed implementation harnesses the parallel processing capabilities of GPUs to simulate large-scale OIM/OPMs, leveraging the advantages of digital computing to offer high precision, programmability, and scalability. The performance of the proposed GPU framework is evaluated on the max-cut problems from the GSET benchmark dataset and graph coloring problems from the SATLIB benchmarks dataset, demonstrating competitive speed and accuracy in tackling large-scale problems. The results from simulations, reaching up to 11295x speed-up over CPUs with up to 99% accuracy, establish this framework as a scalable, massively parallelized, and high-fidelity digital realization of OIM/OPMs. |
| title | GPU-Accelerated Simulated Oscillator Ising/Potts Machine Solving Combinatorial Optimization Problems |
| topic | Hardware Architecture |
| url | https://arxiv.org/abs/2505.22631 |