Solving Boolean satisfiability problems with resistive content addressable memories

Solving optimization problems is a highly demanding workload requiring high-performance computing systems. Optimization solvers are usually difficult to parallelize in conventional digital architectures, particularly when stochastic decisions are involved. Recently, analog computing architectures for accelerating stochastic optimization solvers have been presented, but they were limited to academic problems in quadratic polynomial format. Here we present KLIMA, a k − Local In-Memory Accelerator with resistive Content Addressable Memories (CAMs) and Dot-Product Engines (DPEs) to accelerate the solution of high-order industry-relevant optimization problems, in particular Boolean Satisfiability. By co-designing the optimization heuristics and circuit architecture we improve the speed and energy to the solution up to 182 × compared to the digital state of the art.

Authors

Institutions

Publication Details

Journal
npj Unconventional Computing
Published
2025-04-02
DOI
https://doi.org/10.1038/s44335-025-00020-w
Citations
7
Primary Topic
Advanced Memory and Neural Computing
Type
article
Field-Weighted Citation Impact
5.11

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Solving Boolean satisfiability problems with resistive content addressable memories

E. Valiante, J. W. Moon, Catherine E. Graves, Thomas Van Vaerenbergh et al.
7 citations
npj Unconventional Computing
Advanced Memory and Neural Computing
5.11
article

Solving Boolean satisfiability problems with resistive content addressable memories

E. Valiante, J. W. Moon, Catherine E. Graves, Thomas Van Vaerenbergh, John Paul Strachan, Arne Heittmann, Dmitri B. Strukov, Dongseok Kwon, Jim Ignowski, George Hutchinson, Fabian Böhm, Tinish Bhattacharya, Ignacio Rozada, Mohammad Hizzani, Xiangyi Zhang, Masoud Mohseni, Giacomo Pedretti, Ray Beausoleil
article en
7 citations

Abstract

Solving optimization problems is a highly demanding workload requiring high-performance computing systems. Optimization solvers are usually difficult to parallelize in conventional digital architectures, particularly when stochastic decisions are involved. Recently, analog computing architectures for accelerating stochastic optimization solvers have been presented, but they were limited to academic problems in quadratic polynomial format. Here we present KLIMA, a k − Local In-Memory Accelerator with resistive Content Addressable Memories (CAMs) and Dot-Product Engines (DPEs) to accelerate the solution of high-order industry-relevant optimization problems, in particular Boolean Satisfiability. By co-designing the optimization heuristics and circuit architecture we improve the speed and energy to the solution up to 182 × compared to the digital state of the art.

npj Unconventional ComputingVol. 2(1)
Hewlett-Packard (United States) (US), University of California, Santa Barbara (US), Forschungszentrum Jülich (DE), 1QBit
Defense Advanced Research Projects Agency, Advanced Research Projects Agency, Defense Sciences Office, DARPA, Air Force Research Laboratory
Openalex Percentile: Top 5%
Advanced Memory and Neural Computing
5.11
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.