Biased Random Walk Using Stochastic Switching of Nanomagnets

Application to SAT Solver

Yong Shim, Abhronil Sengupta, Kaushik Roy

Research output: Contribution to journalArticle

Abstract

Random walk (RW)-based local search algorithms are highly popular for solving combinatorial optimization problems such as the satisfiability (SAT) problem. The RW algorithm tries to solve the SAT problem by flipping a randomly chosen variable to minimize the number of unsatisfied clauses for a given problem. In this paper, we propose a biased RW (BRW) based on stochastic magnetization switching dynamics of nanomagnets in the presence of thermal noise. The controllable stochastic switching behavior of nanomagnets is used to flip the current state of the variable of interest based on the assigned probability. Here, the flipping probabilities are assigned to the variables responsible for unsatisfied clauses (instead of deterministic flipping in traditional algorithms). The stochasticity of individual units of the proposed hardware SAT solver based on a magnetic tunnel junction lying on top of a heavy metal layer enables parallel search of the solution space, which results in rapid convergence in comparison to the baseline RW algorithm. A device-circuit-algorithm cosimulation framework (benchmarked to experimental measurements of a magnetic stack) is used to assess the efficiency of the proposal. In comparison to the baseline RW algorithm, stochastic magnetization switching-driven BRW achieves 94% reduction in search time while consuming 30 pJ energy per iteration.

Original languageEnglish (US)
Pages (from-to)1617-1624
Number of pages8
JournalIEEE Transactions on Electron Devices
Volume65
Issue number4
DOIs
StatePublished - Apr 1 2018

Fingerprint

Magnetization
Thermal noise
Tunnel junctions
Combinatorial optimization
Heavy Metals
Heavy metals
Hardware
Networks (circuits)
Local search (optimization)

All Science Journal Classification (ASJC) codes

  • Electronic, Optical and Magnetic Materials
  • Electrical and Electronic Engineering

Cite this

@article{fcfa2b81a45d48a18fc8fb1cad4c8e62,
title = "Biased Random Walk Using Stochastic Switching of Nanomagnets: Application to SAT Solver",
abstract = "Random walk (RW)-based local search algorithms are highly popular for solving combinatorial optimization problems such as the satisfiability (SAT) problem. The RW algorithm tries to solve the SAT problem by flipping a randomly chosen variable to minimize the number of unsatisfied clauses for a given problem. In this paper, we propose a biased RW (BRW) based on stochastic magnetization switching dynamics of nanomagnets in the presence of thermal noise. The controllable stochastic switching behavior of nanomagnets is used to flip the current state of the variable of interest based on the assigned probability. Here, the flipping probabilities are assigned to the variables responsible for unsatisfied clauses (instead of deterministic flipping in traditional algorithms). The stochasticity of individual units of the proposed hardware SAT solver based on a magnetic tunnel junction lying on top of a heavy metal layer enables parallel search of the solution space, which results in rapid convergence in comparison to the baseline RW algorithm. A device-circuit-algorithm cosimulation framework (benchmarked to experimental measurements of a magnetic stack) is used to assess the efficiency of the proposal. In comparison to the baseline RW algorithm, stochastic magnetization switching-driven BRW achieves 94{\%} reduction in search time while consuming 30 pJ energy per iteration.",
author = "Yong Shim and Abhronil Sengupta and Kaushik Roy",
year = "2018",
month = "4",
day = "1",
doi = "10.1109/TED.2018.2808232",
language = "English (US)",
volume = "65",
pages = "1617--1624",
journal = "IEEE Transactions on Electron Devices",
issn = "0018-9383",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

Biased Random Walk Using Stochastic Switching of Nanomagnets : Application to SAT Solver. / Shim, Yong; Sengupta, Abhronil; Roy, Kaushik.

In: IEEE Transactions on Electron Devices, Vol. 65, No. 4, 01.04.2018, p. 1617-1624.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Biased Random Walk Using Stochastic Switching of Nanomagnets

T2 - Application to SAT Solver

AU - Shim, Yong

AU - Sengupta, Abhronil

AU - Roy, Kaushik

PY - 2018/4/1

Y1 - 2018/4/1

N2 - Random walk (RW)-based local search algorithms are highly popular for solving combinatorial optimization problems such as the satisfiability (SAT) problem. The RW algorithm tries to solve the SAT problem by flipping a randomly chosen variable to minimize the number of unsatisfied clauses for a given problem. In this paper, we propose a biased RW (BRW) based on stochastic magnetization switching dynamics of nanomagnets in the presence of thermal noise. The controllable stochastic switching behavior of nanomagnets is used to flip the current state of the variable of interest based on the assigned probability. Here, the flipping probabilities are assigned to the variables responsible for unsatisfied clauses (instead of deterministic flipping in traditional algorithms). The stochasticity of individual units of the proposed hardware SAT solver based on a magnetic tunnel junction lying on top of a heavy metal layer enables parallel search of the solution space, which results in rapid convergence in comparison to the baseline RW algorithm. A device-circuit-algorithm cosimulation framework (benchmarked to experimental measurements of a magnetic stack) is used to assess the efficiency of the proposal. In comparison to the baseline RW algorithm, stochastic magnetization switching-driven BRW achieves 94% reduction in search time while consuming 30 pJ energy per iteration.

AB - Random walk (RW)-based local search algorithms are highly popular for solving combinatorial optimization problems such as the satisfiability (SAT) problem. The RW algorithm tries to solve the SAT problem by flipping a randomly chosen variable to minimize the number of unsatisfied clauses for a given problem. In this paper, we propose a biased RW (BRW) based on stochastic magnetization switching dynamics of nanomagnets in the presence of thermal noise. The controllable stochastic switching behavior of nanomagnets is used to flip the current state of the variable of interest based on the assigned probability. Here, the flipping probabilities are assigned to the variables responsible for unsatisfied clauses (instead of deterministic flipping in traditional algorithms). The stochasticity of individual units of the proposed hardware SAT solver based on a magnetic tunnel junction lying on top of a heavy metal layer enables parallel search of the solution space, which results in rapid convergence in comparison to the baseline RW algorithm. A device-circuit-algorithm cosimulation framework (benchmarked to experimental measurements of a magnetic stack) is used to assess the efficiency of the proposal. In comparison to the baseline RW algorithm, stochastic magnetization switching-driven BRW achieves 94% reduction in search time while consuming 30 pJ energy per iteration.

UR - http://www.scopus.com/inward/record.url?scp=85043376908&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85043376908&partnerID=8YFLogxK

U2 - 10.1109/TED.2018.2808232

DO - 10.1109/TED.2018.2808232

M3 - Article

VL - 65

SP - 1617

EP - 1624

JO - IEEE Transactions on Electron Devices

JF - IEEE Transactions on Electron Devices

SN - 0018-9383

IS - 4

ER -