{"id":157632,"updated":"2025-01-20T13:17:24.220527+00:00","links":{},"created":"2025-01-19T00:31:30.924413+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00157632","sets":["934:935:8438:8439"]},"path":["8439"],"owner":"11","recid":"157632","title":["タスク並列プログラムの効果的なカットオフ閾値の決定"],"pubdate":{"attribute_name":"公開日","attribute_value":"2016-02-26"},"_buckets":{"deposit":"6428c1cf-0e63-4582-b02d-df35bf4546f6"},"_deposit":{"id":"157632","pid":{"type":"depid","value":"157632","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"タスク並列プログラムの効果的なカットオフ閾値の決定","author_link":["298435","298437","298436","298434"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"タスク並列プログラムの効果的なカットオフ閾値の決定"},{"subitem_title":"Effective Decision of Cut-off Threshold for Task Parallel Programs","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[発表概要] ","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2016-02-26","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学情報理工学系研究科"},{"subitem_text_value":"東京大学情報理工学系研究科"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Technology, 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"}]},"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/157632/files/IPSJ-TPRO0901012.pdf","label":"IPSJ-TPRO0901012.pdf"},"date":[{"dateType":"Available","dateValue":"2018-02-26"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TPRO0901012.pdf","filesize":[{"value":"82.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":"15"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"6d8ab2ff-18ba-4b38-b680-685cc0eb9dfe","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2016 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"岩崎, 慎太郎"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"田浦, 健次朗"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Shintaro, Iwasaki","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kenjiro, Taura","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464814","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_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7802","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"タスク並列化は，動的な負荷分散をサポートするほか，分割統治的なプログラムを簡単に並列化できるなどの利点を持つ，有用な並列化手法として知られている．本研究では，コンパイラとタスク並列処理系の2つを組み合わせて，タスク並列プログラムの最適なカットオフを行う手法を提案する．この手法では，コンパイル時にタスク木の構造を静的に解析することで，カットオフを行うことを基本とする．コンパイル時に解析できない構造を持つタスクは，タスク並列処理系が実行時の情報を用いて動的なカットオフを適用する．15個の分割統治的なタスク並列プログラムを用いて，提案手法により実現されるカットオフで得られる性能向上を評価した．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Task parallel programming is one of the promising parallel programming models because of its several advantages: dynamic load balancing and easy parallelization of divide-and-conquer programs. We propose a new method to determine cut-off thresholds of task parallel programs with a combination of a compiler and a task runtime system. Basically, this method decides a cut-off threshold using information of the task-tree structure by analysis at a compiling phase. The task runtime system complementarily adopts dynamic cut-off when the static analysis fails. We evaluated our method by measuring performance improvement of various divide-and-conquer task parallel programs.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"17","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌プログラミング（PRO）"}],"bibliographicPageStart":"17","bibliographicIssueDates":{"bibliographicIssueDate":"2016-02-26","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"9"}]},"relation_version_is_last":true,"weko_creator_id":"11"}}