Hash Distributed A∗on an FPGA

Ryuichi Sakamoto, Yuriko Ezaki, Masaaki Kondo

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

Abstract

Shortest path problem is a problem of finding a path that minimizes the cost of connecting two nodes in a weighted graph. A∗algorithm for solving shortest path search has been applied in various fields such as path navigation systems, automatic robot planning and VLSI design. However, in recent years, the scale of graphs has become large. We need to solve the problem faster and with less power consumption. In this study, we propose a hardware accelerator for solving the shortest path problem using A∗algorithm based on HDA∗(Hash Distributed A∗) using FPGA. In evaluation we compare execution time and power consumption between CPU, GPU and FPGA. FPGA was able to solve Maze problem using the least amount of power. The energy efficiency of FPGA was up to 9 times higher than that of CPU.

Original languageEnglish
Title of host publicationProceedings of the 12th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies, HEART 2022
PublisherAssociation for Computing Machinery
Pages76-83
Number of pages8
ISBN (Electronic)9781450396608
DOIs
Publication statusPublished - 2022 Jun 9
Event12th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies, HEART 2022 - Virtual, Online, Japan
Duration: 2022 Jun 92022 Jun 10

Publication series

NameACM International Conference Proceeding Series

Conference

Conference12th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies, HEART 2022
Country/TerritoryJapan
CityVirtual, Online
Period22/6/922/6/10

Keywords

  • A
  • FPGA
  • HDA
  • High level synthesis
  • Shortest path problem
  • Sorting network

ASJC Scopus subject areas

  • Human-Computer Interaction
  • Computer Networks and Communications
  • Computer Vision and Pattern Recognition
  • Software

Fingerprint

Dive into the research topics of 'Hash Distributed A∗on an FPGA'. Together they form a unique fingerprint.

Cite this