{"created":"2025-01-19T01:20:22.530910+00:00","updated":"2025-01-19T14:36:08.105897+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00220330","sets":["1164:1579:10818:11010"]},"path":["11010"],"owner":"44499","recid":"220330","title":["タスク総時間平均値を利用した分散処理における二段階スケジューリングの改良と評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-10-04"},"_buckets":{"deposit":"02bc101a-8a41-41a9-b68d-ae6f1f4bb4b8"},"_deposit":{"id":"220330","pid":{"type":"depid","value":"220330","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"タスク総時間平均値を利用した分散処理における二段階スケジューリングの改良と評価","author_link":["576099","576098","576100","576101"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"タスク総時間平均値を利用した分散処理における二段階スケジューリングの改良と評価"},{"subitem_title":"Improvement and Evaluation of Two-Stage Scheduling on Distributed Processing Using Total Time Average","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"アルゴリズム・トランザクショナルメモリ","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2022-10-04","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"千葉大学大学院融合理工学府"},{"subitem_text_value":"千葉大学大学院工学研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Science and Engineering, Chiba University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Engineering, Chiba University","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/220330/files/IPSJ-ARC22250017.pdf","label":"IPSJ-ARC22250017.pdf"},"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-ARC22250017.pdf","filesize":[{"value":"1.4 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"16"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_login","version_id":"c27b4a30-8e99-4ef1-9a70-83c8dcdf316a","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Institute of Electronics, Information and Communication Engineers This SIG report is only available to those in membership of the SIG."}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"張, 瀚"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"北神, 正人"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Han, Zhang","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Masato, Kitakami","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10096105","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_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8574","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"コンピュータシステムの複雑化と大規模化によりマルチコアなどの並列処理が多用されている.並列処理を効率よく行うには依存関係のある複数のタスクをマルチコア CPU に割り当てるスケジューリングの効率化が重要になる.効率の良いスケジューリング法として 2 段階スケジューリングが提案されているが,スケジュール長が長くなってしまう問題があった.本稿ではスケジュール長がんば額なる原因となるタスクを分割することによりスケジューリング長を短縮する方法を提案している.評価の結果,スケジューリング長が従来に比べて 16% 程度短縮できるとがわかった.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Due to the increasing complexity and scale of computer systems, parallel processing such as multi-core processing is often used. In order to perform parallel processing efficiently, it is important to improve the efficiency of scheduling by allocating multiple tasks with dependencies to multi-core CPUs. Two-step scheduling has been proposed as an efficient scheduling method, but it has the problem that the schedule length sometimes becomes long. In this paper, we propose a method of shortening the scheduling length by dividing the tasks that cause the schedule length to increase. As a result of the evaluation, it was found that the scheduling length can be shortened by about 16% compared to the conventional method.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告システム・アーキテクチャ(ARC)"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-10-04","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"17","bibliographicVolumeNumber":"2022-ARC-250"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":220330,"links":{}}