The search functionality is under construction.
The search functionality is under construction.

Optimization Algorithm with Automatic Adjustment of the Number of Switches in the Order/Radix Problem

Masaki TSUKAMOTO, Yoshiko HANADA, Masahiro NAKAO, Keiji YAMAMOTO

  • Full Text Views

    0

  • Cite this

Summary :

The Order/Radix Problem (ORP) is an optimization problem that can be solved to find an optimal network topology in distributed memory systems. It is important to find the optimum number of switches in the ORP. In the case of a regular graph, a good estimation of the preferred number of switches has been proposed, and it has been shown that simulated annealing (SA) finds a good solution given a fixed number of switches. However, generally the optimal graph does not necessarily satisfy the regular condition, which greatly increases the computational costs required to find a good solution with a suitable number of switches for each case. This study improved the new method based on SA to find a suitable number of switches. By introducing neighborhood searches in which the number of switches is increased or decreased, our method can optimize a graph by changing the number of switches adaptively during the search. In numerical experiments, we verified that our method shows a good approximation for the best setting for the number of switches, and can simultaneously generate a graph with a small host-to-host average shortest path length, using instances presented by Graph Golf, an international ORP competition.

Publication
IEICE TRANSACTIONS on Information Vol.E106-D No.12 pp.1979-1987
Publication Date
2023/12/01
Publicized
2023/06/12
Online ISSN
1745-1361
DOI
10.1587/transinf.2023PAP0004
Type of Manuscript
Special Section PAPER (Special Section on Forefront Computing)
Category

Authors

Masaki TSUKAMOTO
  Kansai University
Yoshiko HANADA
  Kansai University
Masahiro NAKAO
  RIKEN Center for Computational Science
Keiji YAMAMOTO
  RIKEN Center for Computational Science

Keyword