{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00087066","sets":["581:6644:6923"]},"path":["6923"],"owner":"11","recid":"87066","title":["Two-level Task Scheduling for Parallel Game Tree Search Based on Necessity"],"pubdate":{"attribute_name":"公開日","attribute_value":"2012-11-15"},"_buckets":{"deposit":"43d3540a-49ec-471a-8828-bdfd000eba55"},"_deposit":{"id":"87066","pid":{"type":"depid","value":"87066","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Two-level Task Scheduling for Parallel Game Tree Search Based on Necessity","author_link":["358165","358170","358167","358166","358168","358169"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Two-level Task Scheduling for Parallel Game Tree Search Based on Necessity"},{"subitem_title":"Two-level Task Scheduling for Parallel Game Tree Search Based on Necessity","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[特集：ゲームプログラミング] game tree search, distributed computing, scheduling algorithm, speculative execution","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2012-11-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Engineering, The University of Tokyo"},{"subitem_text_value":"Institute of Industrial Science, The University of Tokyo"},{"subitem_text_value":"Graduate School of Engineering, The University of Tokyo"}]},"item_2_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":"Institute of Industrial Science, The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Engineering, The University of Tokyo","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"publish_status":"0","weko_shared_id":11,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/87066/files/IPSJ-JNL5311021.pdf","label":"IPSJ-JNL5311021"},"date":[{"dateType":"Available","dateValue":"2014-11-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5311021.pdf","filesize":[{"value":"761.4 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":"4d89ca0e-0e3d-4d07-92d5-003240e4e2ff","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2012 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Akira, Ura"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Daisaku, Yokoyama"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takashi, Chikayama"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Akira, Ura","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Daisaku, Yokoyama","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takashi, Chikayama","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":"It is difficult to fully utilize the parallelism of large-scale computing environments in alpha-beta search. The naive parallel execution of subtrees would result in much less task pruning than may have been possible in sequential execution. This may even degrade total performance. To overcome this difficulty, we propose a two-level task scheduling policy in which all tasks are classified into two priority levels based on the necessity for their results. Low priority level tasks are only executed after all high priority level tasks currently executable have started. When new high priority level tasks are generated, the execution of low priority level tasks is suspended so that high level tasks can be executed. We suggest tasks be classified into the two levels based on the Young Brothers Wait Concept, which is widely used in parallel alpha-beta search. The experimental results revealed that the scheduling policy suppresses the degradation in performance caused by executing tasks whose results are eventually found to be unnecessary. We found the new policy improved performance when task granularity was sufficiently large.\n\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.21(2013) No.1 (online)\nDOI http://dx.doi.org/10.2197/ipsjjip.21.17\n------------------------------","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"It is difficult to fully utilize the parallelism of large-scale computing environments in alpha-beta search. The naive parallel execution of subtrees would result in much less task pruning than may have been possible in sequential execution. This may even degrade total performance. To overcome this difficulty, we propose a two-level task scheduling policy in which all tasks are classified into two priority levels based on the necessity for their results. Low priority level tasks are only executed after all high priority level tasks currently executable have started. When new high priority level tasks are generated, the execution of low priority level tasks is suspended so that high level tasks can be executed. We suggest tasks be classified into the two levels based on the Young Brothers Wait Concept, which is widely used in parallel alpha-beta search. The experimental results revealed that the scheduling policy suppresses the degradation in performance caused by executing tasks whose results are eventually found to be unnecessary. We found the new policy improved performance when task granularity was sufficiently large.\n\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.21(2013) No.1 (online)\nDOI http://dx.doi.org/10.2197/ipsjjip.21.17\n------------------------------","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicIssueDates":{"bibliographicIssueDate":"2012-11-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"11","bibliographicVolumeNumber":"53"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"updated":"2025-01-20T06:49:42.590424+00:00","created":"2025-01-18T23:37:56.067456+00:00","links":{},"id":87066}