{"id":18190,"updated":"2025-01-22T22:55:22.245145+00:00","links":{},"created":"2025-01-18T22:50:59.340905+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00018190","sets":["934:1119:1120:1123"]},"path":["1123"],"owner":"1","recid":"18190","title":["行列積を用いた古典Gram-Schmidt直交化法の並列化"],"pubdate":{"attribute_name":"公開日","attribute_value":"2008-06-26"},"_buckets":{"deposit":"1f6051be-02ed-4ca6-9368-47066c9988b8"},"_deposit":{"id":"18190","pid":{"type":"depid","value":"18190","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"行列積を用いた古典Gram-Schmidt直交化法の並列化","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"行列積を用いた古典Gram-Schmidt直交化法の並列化"},{"subitem_title":"Efficient Parallel Implementation of Classical Gram-Schmidt Orthogonalization Using Matrix Multiplication","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"数値計算","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2008-06-26","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"筑波大学大学院システム情報工学研究科"},{"subitem_text_value":"筑波大学大学院システム情報工学研究科"},{"subitem_text_value":"筑波大学大学院システム情報工学研究科"},{"subitem_text_value":"筑波大学大学院システム情報工学研究科"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Systems and Information Engineering, University of Tsukuba","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Systems and Information Engineering, University of Tsukuba","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Systems and Information Engineering, University of Tsukuba","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Systems and Information Engineering, University of Tsukuba","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/18190/files/IPSJ-TACS0101008.pdf"},"date":[{"dateType":"Available","dateValue":"2010-06-26"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TACS0101008.pdf","filesize":[{"value":"422.9 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":"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":"74132cbc-aba4-42f4-8075-af24210b151c","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2008 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"横澤, 拓弥"},{"creatorName":"高橋, 大介"},{"creatorName":"朴, 泰祐"},{"creatorName":"佐藤三久"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Takuya, Yokozawa","creatorNameLang":"en"},{"creatorName":"Daisuke, Takahashi","creatorNameLang":"en"},{"creatorName":"Taisuke, Boku","creatorNameLang":"en"},{"creatorName":"Mitsuhisa, Sato","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":"本論文では，直交化アルゴリズムの1つである古典Gram-Schmidt法（CGS 法）の効率的な実装を行い，並列化して評価した結果について述べる．CGS法においては，内積計算とベクトル変換を行列積に変更することで高速化できることが知られている．本論文では，CGS法を行列積で行う手法を拡張し，行列積を適用できる範囲の比率を高めることで性能を改善することができることを示す．また，行列積の実装上の特徴から，最適な分割手法が存在することを示す．提案する手法をPCクラスタに実装し，性能評価を行った．その結果，32ノードのXeon 3 GHz PCクラスタにおいて，naiveな実装に対し約5.36倍の高速化となり，約122.9GFLOPSの性能を得ることができた．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we propose an efficient parallel implementation of classical Gram-Schmidt (CGS) orthogonalization. It is known that the CGS orthogonalization of a matrix can be altered into a matrix multiplication. We show that the CGS orthogonalization with matrix multiplication improves performance effectively and blocking method using square matrix multiplication improve performance because of matrix's row-column ratio affects DGEMM routine performance. We succeeded in obtaining performance of approximately 122.9GFLOPS on a 32-node Xeon 3 GHz PC cluster.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"72","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌コンピューティングシステム（ACS）"}],"bibliographicPageStart":"61","bibliographicIssueDates":{"bibliographicIssueDate":"2008-06-26","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"1"}]},"relation_version_is_last":true,"weko_creator_id":"1"}}