{"id":13033,"updated":"2025-01-23T01:23:07.050673+00:00","links":{},"created":"2025-01-18T22:47:13.937086+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00013033","sets":["581:716:723"]},"path":["723"],"owner":"1","recid":"13033","title":["ゲーム木の並列探索のための分散共有ハッシュ機構の設計と実現"],"pubdate":{"attribute_name":"公開日","attribute_value":"1998-06-15"},"_buckets":{"deposit":"bff6f0a3-f8ed-4765-beac-b269a12353fb"},"_deposit":{"id":"13033","pid":{"type":"depid","value":"13033","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"ゲーム木の並列探索のための分散共有ハッシュ機構の設計と実現","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ゲーム木の並列探索のための分散共有ハッシュ機構の設計と実現"},{"subitem_title":"Design and Implementation of a Distributed Shared Hashing Mechanism for Searching Game - Trees in Parallel (Special Issue on Parallel Processings)","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"特集：並列処理","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"1998-06-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"電気通信大学電気通信学部情報工学科／現在，日本電気株式会社第三コンピュータソフトウェア事業部"},{"subitem_text_value":"電気通信大学電気通信学部情報工学科"},{"subitem_text_value":"電気通信大学電気通信学部情報工学科"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science, The University of Electro - Communications/Presently with NEC Corporation","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, The University of Electro - Communications","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, The University of Electro - Communications","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/13033/files/IPSJ-JNL3906003.pdf"},"date":[{"dateType":"Available","dateValue":"2000-06-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL3906003.pdf","filesize":[{"value":"723.2 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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"6c7566bb-1fc9-456d-bd05-d68f036c26c1","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1998 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"長島, 紀子"},{"creatorName":"中山, 泰一"},{"creatorName":"野下浩平"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Noriko, Nagashima","creatorNameLang":"en"},{"creatorName":"Yasuichi, Nakayama","creatorNameLang":"en"},{"creatorName":"Kohei, Noshita","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"ゲーム木を探索する場合，異なる枝に同一局面が発生することが頻繁に起きる．この探索の重複を避けるため，局面表（ハッシュ表）に局面を登録し，計算結果を再利用するという手法がよく用いられる．ゲーム木の並列探索するときにも，上記のハッシュ表をプロセッサ間で共有できれば，異なるプロセッサ上で計算した結果が利用でき，計算時間の短縮が期待できる．本研究では，まず，分散メモリ型並列計算機（NEC Cenju?3）上に分散共有ハッシュ機構を設計・実現した．続いて，具体的なゲーム木探索問題としてオセロゲームの先手必勝後手必勝の決定問題を取り上げ，分散共有ハッシュ機構の評価実験を行った．実験の結果，たとえば7×5盤のオセロゲームでは，分散共有ハッシュ機構の導入により約30％計算時間が短縮されることが示された．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This paper proposes a distributed shared hashing mechanism for searching game-trees in parallel on distributed-memory computers.If a parallel program for solving game problems uses hash (transposition) tables shared among all processors and if the overhead caused by interprocessor communications is relatively small,then its computation time can be reduced.We have designed and implemented a distributed shared hashing mechanism on the distributed-memory multiprocessor 'NEC Cenju-3',and have solved M×N Othello (Reversi) problems.The experimental results show that the computation time has been considerably reduced when our hashing mechanism is employed;e.g.for 7×5 Othello problem,it has been reduced by 30%.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1586","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"1581","bibliographicIssueDates":{"bibliographicIssueDate":"1998-06-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"6","bibliographicVolumeNumber":"39"}]},"relation_version_is_last":true,"item_2_alternative_title_2":{"attribute_name":"その他タイトル","attribute_value_mlt":[{"subitem_alternative_title":"並列アルゴリズム"}]},"weko_creator_id":"1"}}