{"created":"2025-01-19T01:31:15.455095+00:00","updated":"2025-01-19T10:52:41.524519+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00231098","sets":["1164:2240:11176:11408"]},"path":["11408"],"owner":"44499","recid":"231098","title":["分散並列環境におけるCholeskyQRとBCGS2を用いた非縦長行列のQR分解"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-11-28"},"_buckets":{"deposit":"e681c5bf-9ba9-42ea-b0cd-6fc386f20204"},"_deposit":{"id":"231098","pid":{"type":"depid","value":"231098","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"分散並列環境におけるCholeskyQRとBCGS2を用いた非縦長行列のQR分解","author_link":["623363","623361","623360","623362"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"分散並列環境におけるCholeskyQRとBCGS2を用いた非縦長行列のQR分解"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"数値計算","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2023-11-28","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"北海道大学大学院情報科学院"},{"subitem_text_value":"北海道大学情報基盤センター"},{"subitem_text_value":"北海道大学情報基盤センター"},{"subitem_text_value":"京都大学学術情報メディアセンター／北海道大学情報基盤センター"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Technology, Hokkaido University","subitem_text_language":"en"},{"subitem_text_value":"Information Initiative Center, Hokkaido University","subitem_text_language":"en"},{"subitem_text_value":"Information Initiative Center, Hokkaido University","subitem_text_language":"en"},{"subitem_text_value":"Academic Center for Computing and Media Studies, Kyoto University / Information Initiative Center, Hokkaido 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/231098/files/IPSJ-HPC23192020.pdf","label":"IPSJ-HPC23192020.pdf"},"date":[{"dateType":"Available","dateValue":"2025-11-28"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-HPC23192020.pdf","filesize":[{"value":"3.7 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"14"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"0e4dc68f-e5bf-47ad-8f46-4ca4bb6f4717","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"門倉, 陣之介"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"深谷, 猛"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"佐竹, 祐樹"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"岩下, 武史"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10463942","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-8841","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"近年，行列の QR 分解を行う数値計算アルゴリズムの一つである CholeskyQR 型アルゴリズムに関する進展があり，縦長行列の QR 分解における有効性が報告されている．これに対して，先行研究で，一般的なマルチコア CPU（共有メモリ）環境において，行列が非縦長の場合には，HouseholderQR などの他の手法と比べて，CholeskyQR 型アルゴリズムが不利になる，ということを実験で示すとともに，CholeskyQR 型アルゴリズムと BCGS2（Block Classical Gram-Schmidt with Reorthogonalization）を組み合わせる手法を提案し，その有効性を確認した．本研究では，分散並列環境における非縦長行列に関して，1 次元ブロック分散を用いて，先行研究で提案した手法の分散並列化を行い，2 種類のスーパーコンピュータ上で，その性能を評価した．性能評価の結果，ある範囲のサイズを持つ行列に対して，CholeskyQR 型アルゴリズム単体よりも BCGS2 と組み合わせた手法の方が実際に高速となることが確認できた．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"15","bibliographic_titles":[{"bibliographic_title":"研究報告ハイパフォーマンスコンピューティング（HPC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2023-11-28","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"20","bibliographicVolumeNumber":"2023-HPC-192"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":231098,"links":{}}