{"created":"2025-01-18T23:29:19.288123+00:00","updated":"2025-01-21T23:41:08.029437+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00069992","sets":["1164:2240:6021:6143"]},"path":["6143"],"owner":"10","recid":"69992","title":["密行列計算アルゴリズムに対するブロック分割法の最適化と性能評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2010-07-27"},"_buckets":{"deposit":"53459eda-c134-4a84-bede-81c086633f5b"},"_deposit":{"id":"69992","pid":{"type":"depid","value":"69992","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"密行列計算アルゴリズムに対するブロック分割法の最適化と性能評価","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"密行列計算アルゴリズムに対するブロック分割法の最適化と性能評価"},{"subitem_title":"Perforamnce Optimization and Evaluation of the Blocking Strategy for the Dense Matrix COmputations","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"数値解析と応用","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2010-07-27","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"名古屋大学大学院工学研究科計算理工学専攻"},{"subitem_text_value":"神戸大学大学院システム情報学研究科計算科学専攻"},{"subitem_text_value":"名古屋大学大学院工学研究科計算理工学専攻"}]},"item_4_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/69992/files/IPSJ-HPC10126033.pdf"},"date":[{"dateType":"Available","dateValue":"2012-07-27"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-HPC10126033.pdf","filesize":[{"value":"86.2 kB"}],"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":"b99836de-32a4-4066-a87f-2a1f565c430d","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2010 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"深谷, 猛"},{"creatorName":"山本, 有作"},{"creatorName":"張, 紹良"}],"nameIdentifiers":[{}]}]},"item_4_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_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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"高性能な行列計算を行う場合，プログラムの性能チューニングが必要不可欠である．我々は基本的な密行列計算が BLAS ルーチンを使って実行される点に着目し，チューニング済みの BLAS ルーチンを効率的に使えるようにプログラムをチューニングすることを目指す．ブロック化されたアルゴリズムにおいて，効率的に BLAS を使うためには行列のブロック分割法を最適化することが重要となる．本稿では，LU 分解のアルゴリズムをブロック化して，ブロック分割法が性能に与える影響を評価し，さらに適切な分割法を決定するための手法の検討を行う．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"For high performance matrix computations, it is necessity to tune the software. Since basic dense matrix computations consist almost entirely of the BLAS routines, it is important how to tune programs for exploiting the peak performance of optimized BLAS routines. In blocked algorithm, this means how to optimize the partitioning of the target matrix. In this paper, we evaluate and discuss the blocking strategy for the blocked LU decomposition.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告ハイパフォーマンスコンピューティング（HPC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2010-07-27","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"33","bibliographicVolumeNumber":"2010-HPC-126"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"id":69992,"links":{}}