Hash Distributed A∗on an FPGA

Ryuichi Sakamoto, Yuriko Ezaki, Masaaki Kondo

研究成果: Conference contribution

抄録

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.

本文言語English
ホスト出版物のタイトルProceedings of the 12th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies, HEART 2022
出版社Association for Computing Machinery
ページ76-83
ページ数8
ISBN(電子版)9781450396608
DOI
出版ステータスPublished - 2022 6月 9
イベント12th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies, HEART 2022 - Virtual, Online, Japan
継続期間: 2022 6月 92022 6月 10

出版物シリーズ

名前ACM International Conference Proceeding Series

Conference

Conference12th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies, HEART 2022
国/地域Japan
CityVirtual, Online
Period22/6/922/6/10

ASJC Scopus subject areas

  • ソフトウェア
  • 人間とコンピュータの相互作用
  • コンピュータ ビジョンおよびパターン認識
  • コンピュータ ネットワークおよび通信

フィンガープリント

「Hash Distributed A∗on an FPGA」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル