Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bloomer, Everest, Didin, Irem, Lin, Ching-Yi, Shah, Sahil
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2603.12415
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866915858574475264
author Bloomer, Everest
Didin, Irem
Lin, Ching-Yi
Shah, Sahil
author_facet Bloomer, Everest
Didin, Irem
Lin, Ching-Yi
Shah, Sahil
contents Computational workloads are growing exponentially, driving power consumption to unsustainable levels. Efficiently distributing large-scale networks is an NP-Complete problem equivalent to Boolean satisfiability (SAT), making it one of the core challenges in modern computation. To address this, physics and device inspired methods such as Ising systems have been explored for solving SAT more efficiently. In this work, we implement an Ising model equivalence of the 3-SAT problem using a ReRAM crossbar fabricated in the Skywater 130 nm CMOS process. Our ReRAM-based algorithm achieves $91.0\%$ accuracy in matrix representation across iterative reprogramming cycles. Additionally, we establish a foundational energy profile by measuring the energy costs of small sub-matrix structures within the problem space, demonstrating under linear growth trajectory for combining sub-matrices into larger problems. These results demonstrate a promising platform for developing scalable architectures to accelerate NP-Complete problem solving.
format Preprint
id arxiv_https___arxiv_org_abs_2603_12415
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Ising-ReRAM: A Low Power Ising Machine ReRAM Crossbar for NP Problems
Bloomer, Everest
Didin, Irem
Lin, Ching-Yi
Shah, Sahil
Systems and Control
Computational workloads are growing exponentially, driving power consumption to unsustainable levels. Efficiently distributing large-scale networks is an NP-Complete problem equivalent to Boolean satisfiability (SAT), making it one of the core challenges in modern computation. To address this, physics and device inspired methods such as Ising systems have been explored for solving SAT more efficiently. In this work, we implement an Ising model equivalence of the 3-SAT problem using a ReRAM crossbar fabricated in the Skywater 130 nm CMOS process. Our ReRAM-based algorithm achieves $91.0\%$ accuracy in matrix representation across iterative reprogramming cycles. Additionally, we establish a foundational energy profile by measuring the energy costs of small sub-matrix structures within the problem space, demonstrating under linear growth trajectory for combining sub-matrices into larger problems. These results demonstrate a promising platform for developing scalable architectures to accelerate NP-Complete problem solving.
title Ising-ReRAM: A Low Power Ising Machine ReRAM Crossbar for NP Problems
topic Systems and Control
url https://arxiv.org/abs/2603.12415