{"id":78060,"created":"2025-01-18T23:33:31.023630+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00078060","sets":["934:1119:6347:6556"]},"path":["6556"],"owner":"10","recid":"78060","title":["動的計画法を用いたブロックハウスホルダQR分解アルゴリズムの性能最適化"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-10-05"},"_buckets":{"deposit":"35fe14fe-9be5-437e-bf4d-bb06e40e15c0"},"_deposit":{"id":"78060","pid":{"type":"depid","value":"78060","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"動的計画法を用いたブロックハウスホルダQR分解アルゴリズムの性能最適化","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"動的計画法を用いたブロックハウスホルダQR分解アルゴリズムの性能最適化"},{"subitem_title":"Performance Optimization for the Blocked Householder QR Decomposition Using the Dynamic Programming","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"自動チューニング","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2011-10-05","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"名古屋大学大学院工学研究科計算理工学専攻"},{"subitem_text_value":"神戸大学大学院システム情報学研究科計算科学専攻"},{"subitem_text_value":"名古屋大学大学院工学研究科計算理工学専攻"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Computational Science and Engineering, Graduate School of Engineering, Nagoya University","subitem_text_language":"en"},{"subitem_text_value":"Department of Computational Science, Graduate School of System Informatics, Kobe University","subitem_text_language":"en"},{"subitem_text_value":"Department of Computational Science and Engineering, Graduate School of Engineering, Nagoya 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/78060/files/IPSJ-TACS0404015.pdf"},"date":[{"dateType":"Available","dateValue":"2013-10-05"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TACS0404015.pdf","filesize":[{"value":"1.3 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":"16"},{"tax":["include_tax"],"price":"0","billingrole":"11"},{"tax":["include_tax"],"price":"0","billingrole":"14"},{"tax":["include_tax"],"price":"0","billingrole":"15"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"f25771e6-c0ad-459d-b781-6b35c471f587","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"深谷, 猛"},{"creatorName":"山本, 有作"},{"creatorName":"張, 紹良"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Takeshi, Fukaya","creatorNameLang":"en"},{"creatorName":"Yusaku, Yamamoto","creatorNameLang":"en"},{"creatorName":"Shao-Liang, Zhang","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11833852","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-7829","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"密行列計算においては，高性能化のためにアルゴリズムのブロック化が必須である．その際に，ブロック化の方法次第で性能が大きく変化するため，その最適化が重要な課題となっている．しかしながら，ブロック化の自由度が大きいため，従来は限定された範囲内で最適化を行うことがほとんどである．本論文では，QR 分解アルゴリズムを対象として，二分木を使うことで従来より格段に広いクラスのブロック化の方法を系統的に扱い，その中から動的計画法により最適なブロック化の方法を決定する手法を提案する．数値実験の結果，提案手法がブロック分割法に対する自動チューニング手法として有望であることが示された．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Blocking techniques are widely used in high performance matrix computations. When using them, it is important to optimize a blocking way, which influences the performance of computations. However, because of the high degree of freedom in blocking techniques, such optimization is generally done in a limited class of blocking ways. In this paper, we propose a framework to determine the efficient blocking way for the algorithm of QR decomposition. In our framework, various kinds of blocking ways are represented systematically with binary trees and an optimal one is determined by dynamic programming. Results of numerical experiments show that our framework has good possibilities in the view of the automatic performance tuning.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"157","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌コンピューティングシステム（ACS）"}],"bibliographicPageStart":"146","bibliographicIssueDates":{"bibliographicIssueDate":"2011-10-05","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"4","bibliographicVolumeNumber":"4"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"updated":"2025-01-21T20:39:39.608964+00:00","links":{}}