Efficient Ising Model Mapping to Solving Slot Placement Problem

Sho Kanamaru, Daisuke Oku, Masashi Tawada, Shu Tanaka, Masato Hayashi, Masanao Yamaoka, Masao Yanagisawa, Nozomu Togawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Ising model-based computation has attracted attention as it can obtain better solutions of various combinatorial optimization problems at high speed by mapping the problems to natural phenomena. A slot placement problem is one of the combinatorial optimization problems which plays an important role in the optimal logic-block placement as well as optimal delivery decisions but it is known as an NP-hard problem. Solving it efficiently is one of the largest challenges. In this paper, we propose an efficient Ising model mapping to solve the slot placement problem and an interpretation method for the obtained Ising solutions to satisfy the slot-placement constraints. First, we propose slot-placement constraint terms that minimize the energy function or Hamiltonian of the Ising model when satisfying the slot-placement constraints. Secondly, we propose an objective function term in the energy function that minimizes the total weighted wiring length between items to be placed to the slots. In Ising model-based computations, the final spin states cannot necessarily satisfy the slot-placement constraints, which gives one of the largest differences from the conventional computations. Hence we newly propose an interpretation method for the obtained Ising solutions to satisfy the slot-placement constraints. On a fully-connected annealing machine, we could obtain feasible solutions with almost the same accuracy as the simulated annealing for slot placement problem with two orders of magnitude faster.

Original languageEnglish
Title of host publication2019 IEEE International Conference on Consumer Electronics, ICCE 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538679104
DOIs
Publication statusPublished - 2019 Mar 6
Event2019 IEEE International Conference on Consumer Electronics, ICCE 2019 - Las Vegas, United States
Duration: 2019 Jan 112019 Jan 13

Publication series

Name2019 IEEE International Conference on Consumer Electronics, ICCE 2019

Conference

Conference2019 IEEE International Conference on Consumer Electronics, ICCE 2019
CountryUnited States
CityLas Vegas
Period19/1/1119/1/13

Fingerprint

Ising model
Combinatorial optimization
Hamiltonians
Electric wiring
Simulated annealing
Computational complexity
Annealing

Keywords

  • annealing machine
  • Ising model
  • Ising model-based computers
  • slot placement problem

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • Media Technology
  • Electrical and Electronic Engineering

Cite this

Kanamaru, S., Oku, D., Tawada, M., Tanaka, S., Hayashi, M., Yamaoka, M., ... Togawa, N. (2019). Efficient Ising Model Mapping to Solving Slot Placement Problem. In 2019 IEEE International Conference on Consumer Electronics, ICCE 2019 [8661947] (2019 IEEE International Conference on Consumer Electronics, ICCE 2019). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCE.2019.8661947

Efficient Ising Model Mapping to Solving Slot Placement Problem. / Kanamaru, Sho; Oku, Daisuke; Tawada, Masashi; Tanaka, Shu; Hayashi, Masato; Yamaoka, Masanao; Yanagisawa, Masao; Togawa, Nozomu.

2019 IEEE International Conference on Consumer Electronics, ICCE 2019. Institute of Electrical and Electronics Engineers Inc., 2019. 8661947 (2019 IEEE International Conference on Consumer Electronics, ICCE 2019).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kanamaru, S, Oku, D, Tawada, M, Tanaka, S, Hayashi, M, Yamaoka, M, Yanagisawa, M & Togawa, N 2019, Efficient Ising Model Mapping to Solving Slot Placement Problem. in 2019 IEEE International Conference on Consumer Electronics, ICCE 2019., 8661947, 2019 IEEE International Conference on Consumer Electronics, ICCE 2019, Institute of Electrical and Electronics Engineers Inc., 2019 IEEE International Conference on Consumer Electronics, ICCE 2019, Las Vegas, United States, 19/1/11. https://doi.org/10.1109/ICCE.2019.8661947
Kanamaru S, Oku D, Tawada M, Tanaka S, Hayashi M, Yamaoka M et al. Efficient Ising Model Mapping to Solving Slot Placement Problem. In 2019 IEEE International Conference on Consumer Electronics, ICCE 2019. Institute of Electrical and Electronics Engineers Inc. 2019. 8661947. (2019 IEEE International Conference on Consumer Electronics, ICCE 2019). https://doi.org/10.1109/ICCE.2019.8661947
Kanamaru, Sho ; Oku, Daisuke ; Tawada, Masashi ; Tanaka, Shu ; Hayashi, Masato ; Yamaoka, Masanao ; Yanagisawa, Masao ; Togawa, Nozomu. / Efficient Ising Model Mapping to Solving Slot Placement Problem. 2019 IEEE International Conference on Consumer Electronics, ICCE 2019. Institute of Electrical and Electronics Engineers Inc., 2019. (2019 IEEE International Conference on Consumer Electronics, ICCE 2019).
@inproceedings{79ad1a27fee84b4fa80d00e9bde4429a,
title = "Efficient Ising Model Mapping to Solving Slot Placement Problem",
abstract = "Ising model-based computation has attracted attention as it can obtain better solutions of various combinatorial optimization problems at high speed by mapping the problems to natural phenomena. A slot placement problem is one of the combinatorial optimization problems which plays an important role in the optimal logic-block placement as well as optimal delivery decisions but it is known as an NP-hard problem. Solving it efficiently is one of the largest challenges. In this paper, we propose an efficient Ising model mapping to solve the slot placement problem and an interpretation method for the obtained Ising solutions to satisfy the slot-placement constraints. First, we propose slot-placement constraint terms that minimize the energy function or Hamiltonian of the Ising model when satisfying the slot-placement constraints. Secondly, we propose an objective function term in the energy function that minimizes the total weighted wiring length between items to be placed to the slots. In Ising model-based computations, the final spin states cannot necessarily satisfy the slot-placement constraints, which gives one of the largest differences from the conventional computations. Hence we newly propose an interpretation method for the obtained Ising solutions to satisfy the slot-placement constraints. On a fully-connected annealing machine, we could obtain feasible solutions with almost the same accuracy as the simulated annealing for slot placement problem with two orders of magnitude faster.",
keywords = "annealing machine, Ising model, Ising model-based computers, slot placement problem",
author = "Sho Kanamaru and Daisuke Oku and Masashi Tawada and Shu Tanaka and Masato Hayashi and Masanao Yamaoka and Masao Yanagisawa and Nozomu Togawa",
year = "2019",
month = "3",
day = "6",
doi = "10.1109/ICCE.2019.8661947",
language = "English",
series = "2019 IEEE International Conference on Consumer Electronics, ICCE 2019",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2019 IEEE International Conference on Consumer Electronics, ICCE 2019",

}

TY - GEN

T1 - Efficient Ising Model Mapping to Solving Slot Placement Problem

AU - Kanamaru, Sho

AU - Oku, Daisuke

AU - Tawada, Masashi

AU - Tanaka, Shu

AU - Hayashi, Masato

AU - Yamaoka, Masanao

AU - Yanagisawa, Masao

AU - Togawa, Nozomu

PY - 2019/3/6

Y1 - 2019/3/6

N2 - Ising model-based computation has attracted attention as it can obtain better solutions of various combinatorial optimization problems at high speed by mapping the problems to natural phenomena. A slot placement problem is one of the combinatorial optimization problems which plays an important role in the optimal logic-block placement as well as optimal delivery decisions but it is known as an NP-hard problem. Solving it efficiently is one of the largest challenges. In this paper, we propose an efficient Ising model mapping to solve the slot placement problem and an interpretation method for the obtained Ising solutions to satisfy the slot-placement constraints. First, we propose slot-placement constraint terms that minimize the energy function or Hamiltonian of the Ising model when satisfying the slot-placement constraints. Secondly, we propose an objective function term in the energy function that minimizes the total weighted wiring length between items to be placed to the slots. In Ising model-based computations, the final spin states cannot necessarily satisfy the slot-placement constraints, which gives one of the largest differences from the conventional computations. Hence we newly propose an interpretation method for the obtained Ising solutions to satisfy the slot-placement constraints. On a fully-connected annealing machine, we could obtain feasible solutions with almost the same accuracy as the simulated annealing for slot placement problem with two orders of magnitude faster.

AB - Ising model-based computation has attracted attention as it can obtain better solutions of various combinatorial optimization problems at high speed by mapping the problems to natural phenomena. A slot placement problem is one of the combinatorial optimization problems which plays an important role in the optimal logic-block placement as well as optimal delivery decisions but it is known as an NP-hard problem. Solving it efficiently is one of the largest challenges. In this paper, we propose an efficient Ising model mapping to solve the slot placement problem and an interpretation method for the obtained Ising solutions to satisfy the slot-placement constraints. First, we propose slot-placement constraint terms that minimize the energy function or Hamiltonian of the Ising model when satisfying the slot-placement constraints. Secondly, we propose an objective function term in the energy function that minimizes the total weighted wiring length between items to be placed to the slots. In Ising model-based computations, the final spin states cannot necessarily satisfy the slot-placement constraints, which gives one of the largest differences from the conventional computations. Hence we newly propose an interpretation method for the obtained Ising solutions to satisfy the slot-placement constraints. On a fully-connected annealing machine, we could obtain feasible solutions with almost the same accuracy as the simulated annealing for slot placement problem with two orders of magnitude faster.

KW - annealing machine

KW - Ising model

KW - Ising model-based computers

KW - slot placement problem

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

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

U2 - 10.1109/ICCE.2019.8661947

DO - 10.1109/ICCE.2019.8661947

M3 - Conference contribution

AN - SCOPUS:85063795425

T3 - 2019 IEEE International Conference on Consumer Electronics, ICCE 2019

BT - 2019 IEEE International Conference on Consumer Electronics, ICCE 2019

PB - Institute of Electrical and Electronics Engineers Inc.

ER -