{"created":"2025-01-19T01:15:26.188613+00:00","updated":"2025-01-19T16:32:31.749846+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00214629","sets":["6504:10735:10736"]},"path":["10736"],"owner":"44499","recid":"214629","title":["大規模環境における動的実行領域分割アルゴリズムの提案と評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-03-04"},"_buckets":{"deposit":"17089cf0-f4b0-4e7a-9e5a-c7be7268fe3e"},"_deposit":{"id":"214629","pid":{"type":"depid","value":"214629","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"大規模環境における動的実行領域分割アルゴリズムの提案と評価","author_link":["551746","551744","551745","551747","551748"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"大規模環境における動的実行領域分割アルゴリズムの提案と評価"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"コンピュータシステム","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2021-03-04","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"お茶の水女子大"},{"subitem_text_value":"富士通"},{"subitem_text_value":"富士通研"},{"subitem_text_value":"富士通研"},{"subitem_text_value":"お茶の水女子大"}]},"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/214629/files/IPSJ-Z83-2H-01.pdf","label":"IPSJ-Z83-2H-01.pdf"},"date":[{"dateType":"Available","dateValue":"2021-12-28"}],"format":"application/pdf","filename":"IPSJ-Z83-2H-01.pdf","filesize":[{"value":"614.1 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"985bd640-ed17-4d71-9589-3dfdde5a06f7","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"高山, 沙也加"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"関澤, 龍一"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"鈴木, 成人"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"山本, 拓司"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"小口, 正人"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"近年のHPCシステムでは利用者の増加と利用者層の拡大に伴い,投入されるジョブ数および実行ノード数は増加しており, 多様化している. これに伴い, 大量かつジョブ実行ノード数が多様化したジョブ群をより効率的に運用するジョブスケジューリングが必要となる. ジョブスケジューリングで最も重視される指標としてジョブ待ち時間とシステム充填率が挙げられる. 待ち時間は, ジョブ投入から実行されるまでの時間であり, ユーザが特に重視する指標である. システム充填率は, 利用可能な計算機資源のうち実際に利用された割合であり, 運用者が重視する指標である. ここで, 実行ノード数が小さいジョブが実行ノード数が大きい大規模ジョブの割り当ての妨げとなることで待ち時間が著しく長いジョブが生じてしまうことがあり, この軽減が大きな課題となる.本稿では, ジョブの最大最小の実行ノード数の割合を一定になるようにジョブ群とその実行領域を分割し実行することで, 大規模ジョブの待ち時間の削減と充填率の両立を実現するジョブスケジューリング手法を提案し, その効果検証を行った.","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"32","bibliographic_titles":[{"bibliographic_title":"第83回全国大会講演論文集"}],"bibliographicPageStart":"31","bibliographicIssueDates":{"bibliographicIssueDate":"2021-03-04","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2021"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":214629,"links":{}}