{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00203302","sets":["1164:2036:10071:10144"]},"path":["10144"],"owner":"44499","recid":"203302","title":["経路探索処理向け専用ハードウェアの検討"],"pubdate":{"attribute_name":"公開日","attribute_value":"2020-02-20"},"_buckets":{"deposit":"686c7c38-1221-49b9-9f94-0df6ce2ab598"},"_deposit":{"id":"203302","pid":{"type":"depid","value":"203302","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"経路探索処理向け専用ハードウェアの検討","author_link":["500736","500737","500738"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"経路探索処理向け専用ハードウェアの検討"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"アクセラレーション","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2020-02-20","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学工学部計数工学科"},{"subitem_text_value":"東京大学大学院情報理工学系研究科"},{"subitem_text_value":"東京大学大学院情報理工学系研究科／理化学研究所R-CCS"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/203302/files/IPSJ-SLDM20191019.pdf","label":"IPSJ-SLDM20191019.pdf"},"date":[{"dateType":"Available","dateValue":"2022-02-20"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SLDM20191019.pdf","filesize":[{"value":"683.1 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"10"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"5260979e-6209-475e-9dfd-58c4a1652740","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2020 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"江崎, ゆり子"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"坂本, 龍一"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"近藤, 正章"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11451459","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8639","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"最短経路探索問題とは，重み付きグラフにおいて 2 つのノードを結ぶコストが最小となる経路を求める問題である．最短経路探索問題を解く A* アルゴリズムは経路ナビゲーションシステムやロボットの自動計画，VLSI 設計など，様々な分野に応用されている．しかしながら，情報量の増大とともにグラフ規模は大規模なものとなることが予想され，より高速かつ省電力に問題を解くことが重要である．本研究では最短経路探索問題について A* アルゴリズムを用いて解く専用ハードウェアを FPGA を用いて HDA* (Hash Distributed A*) をベースに作成し，実行時間と電力について評価を行った．さらに，マルチコア化やコア内部の並列化を行い，実行時間のシミュレーション結果を比較した．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告システムとLSIの設計技術（SLDM）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2020-02-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"19","bibliographicVolumeNumber":"2020-SLDM-191"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":203302,"updated":"2025-01-19T20:35:49.596331+00:00","links":{},"created":"2025-01-19T01:05:44.193837+00:00"}