{"updated":"2025-01-21T20:34:35.832185+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00078256","sets":["6164:6165:6210:6568"]},"path":["6568"],"owner":"10","recid":"78256","title":["探索が必要となる確率を用いた並列αβ探索のスケジューリング"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-11-04"},"_buckets":{"deposit":"e33ae85b-293b-4710-a91a-cf81bcfb839f"},"_deposit":{"id":"78256","pid":{"type":"depid","value":"78256","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"探索が必要となる確率を用いた並列αβ探索のスケジューリング","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"探索が必要となる確率を用いた並列αβ探索のスケジューリング"},{"subitem_title":"Scheduling for Parallel Alpha-Beta Search with Probability of Search Necessity","subitem_title_language":"en"}]},"item_type_id":"18","publish_date":"2011-11-04","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学大学院工学系研究科"},{"subitem_text_value":"マンチェスター大学コンピュータ科学科"},{"subitem_text_value":"東京大学生産技術研究所"},{"subitem_text_value":"東京大学大学院情報理工学系研究科"},{"subitem_text_value":"東京大学大学院工学系研究科"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Engineering, The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"School of Computer Science, The University of Manchester","subitem_text_language":"en"},{"subitem_text_value":"Institute of Industrial Science, The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Engineering, The University of Tokyo","subitem_text_language":"en"}]},"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/78256/files/IPSJ-GPWS2011010.pdf"},"date":[{"dateType":"Available","dateValue":"2011-11-04"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-GPWS2011010.pdf","filesize":[{"value":"354.6 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"18"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"0278eceb-38d7-403c-8a87-c003882b3d32","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"浦, 晃"},{"creatorName":"三輪, 誠"},{"creatorName":"横山, 大作"},{"creatorName":"田浦, 健次朗"},{"creatorName":"近山, 隆"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Akira, Ura","creatorNameLang":"en"},{"creatorName":"Makoto, Miwa","creatorNameLang":"en"},{"creatorName":"Daisaku, Yokoyama","creatorNameLang":"en"},{"creatorName":"Kenjiro, Taura","creatorNameLang":"en"},{"creatorName":"Takashi, Chikayama","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"大規模な環境を用いた並列αβ探索は、探索の必要性が明らかになっている計算を実行するだけでは、並列度が小さいため十分な性能を達成することができない。そこで、その時点では必要性が明らかでない計算を投機的に実行することが有効である。無駄な実行を減らすために優先度を導入して投機的なタスクの中での実行順を制御する必要があるが、従来用いられている優先度は探索の必要性の度合いを考慮していない。本稿では、ノードの探索が必要となる確率を推定し、優先度に用いることを提案する。将棋のゲーム木を用いた評価では有効性を示すことは出来なかったが、人工木でのシミュレーションでは有効性を示せたため、確率の推定が改善されれば、性能向上に繋がる可能性があることが分かった。","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Naive parallel alpha-beta search that executes mandatory calculation only in large-scale environments cannot realize high performance because of low parallelism. Hence, speculative execution of the calculation whose necessity is not revealed at a certain point is effective. Usually, some prioritization is introduced to reduce too much wasteful tasks, however, existing priorities do not consider the necessity level of computation. In this paper, we propose a new priority scheme using estimated probabilities of the necessity to search each node. Evaluation with shogi game trees does not show the effectiveness of the proposed priority, but it is expected that more accurate probability estimation would lead to performance improvements\nbecause the proposed priority is effective with artificial game trees.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"75","bibliographic_titles":[{"bibliographic_title":"ゲームプログラミングワークショップ2011論文集"}],"bibliographicPageStart":"68","bibliographicIssueDates":{"bibliographicIssueDate":"2011-10-28","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"6","bibliographicVolumeNumber":"2011"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"created":"2025-01-18T23:33:38.868899+00:00","id":78256,"links":{}}