{"created":"2025-01-18T23:31:42.326727+00:00","updated":"2025-01-21T21:44:29.421905+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00073948","sets":["1164:2592:6240:6405"]},"path":["6405"],"owner":"10","recid":"73948","title":["超平面ハッシュ関数に基づく分散A<sup>*</sup> アルゴリズムの提案と多重配列アラインメント問題への応用"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-05-09"},"_buckets":{"deposit":"bf5f8914-bd63-4058-b91a-9ef717738bc3"},"_deposit":{"id":"73948","pid":{"type":"depid","value":"73948","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"超平面ハッシュ関数に基づく分散A<sup>*</sup> アルゴリズムの提案と多重配列アラインメント問題への応用","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"超平面ハッシュ関数に基づく分散A<sup>*</sup> アルゴリズムの提案と多重配列アラインメント問題への応用"},{"subitem_title":"A Distributed A<sup>*</sup> Algorithm Based on the Hyperplane Function and Its Application to Multiple Sequence Alignment","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2011-05-09","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京工業大学大学院情報理工学研究科数理・計算科学専攻"},{"subitem_text_value":"東京工業大学大学院情報理工学研究科数理・計算科学専攻"},{"subitem_text_value":"東京工業大学大学院情報理工学研究科数理・計算科学専攻"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Mathematical and Computing Sciences, Graduate School of Information Science and Engineering, Tokyo Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Mathematical and Computing Sciences, Graduate School of Information Science and Engineering, Tokyo Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Mathematical and Computing Sciences, Graduate School of Information Science and Engineering, Tokyo Institute of Technology","subitem_text_language":"en"}]},"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/73948/files/IPSJ-AL11135002.pdf"},"date":[{"dateType":"Available","dateValue":"2013-05-09"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL11135002.pdf","filesize":[{"value":"153.3 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":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"556e4166-d737-4ed3-842d-9a4a12b7572e","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"小林, 義和"},{"creatorName":"岸本, 章宏"},{"creatorName":"渡辺, 治"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yoshikazu, Kobayashi","creatorNameLang":"en"},{"creatorName":"Akihiro, Kishimoto","creatorNameLang":"en"},{"creatorName":"Osamu, Watanabe","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"分散メモリ環境での A* アルゴリズムの並列化は，アルゴリズムの解答速度および解答能力向上のために重要な課題である．本論文では，単純であるが効果的な A* の並列化である Hash Distributed A*(HDA*) アルゴリズム上に超平面ハッシュ関数を利用し仕事を分配する方法を提案する．この仕事分配方法の性能を，マルチコア CPU を持つマシンで構成される PC クラスター上で，最適多重配列アラインメントの難しいベンチマーク問題を解かせることで評価し，この手法でベンチマーク問題に対しては，384CPU コアまで高い台数効果を達成すること示した．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Parallelizing the A* algorithm in distributed memory environments plays an important role in both achieving speedups and improving its solving ability. This paper presents a new work distribution strategy based on the hyperplane function, which is combined with simple but scalable parallel A* called Hash Distributed A*. The performance was evaluated on a cluster of multi-core machines and the presented strategy was shown to scale well up to 384 cores in solving difficult instances of the optimal multiple sequence alignment.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2011-05-09","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"2011-AL-135"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"id":73948,"links":{}}