{"id":29319,"updated":"2025-01-22T17:37:28.623720+00:00","links":{},"created":"2025-01-18T22:59:12.084980+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00029319","sets":["1164:2240:2273:2277"]},"path":["2277"],"owner":"1","recid":"29319","title":["並列疎行列ベクトル積における最適なアルゴリズム選択の効果"],"pubdate":{"attribute_name":"公開日","attribute_value":"2002-03-07"},"_buckets":{"deposit":"11c94e80-04f5-489c-add5-1637d4c61ff6"},"_deposit":{"id":"29319","pid":{"type":"depid","value":"29319","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"並列疎行列ベクトル積における最適なアルゴリズム選択の効果","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"並列疎行列ベクトル積における最適なアルゴリズム選択の効果"},{"subitem_title":"The Effect of Optimal Algorithm Selection of Parallel Sparse Matrix - Vector Multiplication","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2002-03-07","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学大学院情報理工学系研究科コンピュータ科学専攻"},{"subitem_text_value":"東京大学情報基盤センタースーパーコンピューティング研究部門"},{"subitem_text_value":"科学技術振興事業団，さきがけ研究21"},{"subitem_text_value":"東京大学情報基盤センタースーパーコンピューティング研究部門"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science, Graduate School of Information Science and Technology, the University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Computer Centre Division, Information Technology Center, the University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"PRESTO, Japan Science and Technology Corporation (JST)","subitem_text_language":"en"},{"subitem_text_value":"Computer Centre Division, Information Technology Center, the University of Tokyo","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/29319/files/IPSJ-HPC01089026.pdf"},"date":[{"dateType":"Available","dateValue":"2004-03-07"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-HPC01089026.pdf","filesize":[{"value":"203.3 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":"a0faa93c-c7b0-4942-9596-e81d5cad8a15","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2002 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"工藤, 誠"},{"creatorName":"黒田, 久泰"},{"creatorName":"片桐, 孝洋"},{"creatorName":"金田, 康正"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Makoto, Kudoh","creatorNameLang":"en"},{"creatorName":"Hisayasu, Kuroda","creatorNameLang":"en"},{"creatorName":"Takahiro, Katagiri","creatorNameLang":"en"},{"creatorName":"Yasumasa, Kanada","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":"並列疎行列ベクトル積の性能は行列の構造や計算機の性質に大きく依存するため，これらの性質に合わせた高速化手法で計算することが重要である．本論文では筆者らの作成した複数の高速化手法を含んだ並列疎行列ベクトル積のルーチンを紹介する．また行列や計算機の性質に応じて最適な高速化手法を選択した場合の性能を，従来法である妥当な固定手法を用いた場合の性能と比較する．4機種の並列計算機上での実験では，最適なアルゴリズム選択により平均して1.29倍の速度向上が得られた．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The computational performance of parallel sparse matrix-vector multiplication (SpMxV) depends highly on the non-zero structure of the target matrix and the nature of machine's architecture. Therefore it is important to select the best optimization method according to these characteristics. In this paper, our parallel SpMxV routine which includes several optimization algorithms is described, and the performance with optimal algorithm is compared to that with uniform default algorithm on 4 kinds of parallel machines. The average speed-up of 1.29 is obtained.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"156","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告ハイパフォーマンスコンピューティング（HPC）"}],"bibliographicPageStart":"151","bibliographicIssueDates":{"bibliographicIssueDate":"2002-03-07","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"22(2001-HPC-089)","bibliographicVolumeNumber":"2002"}]},"relation_version_is_last":true,"weko_creator_id":"1"}}