{"updated":"2025-01-21T11:14:28.562243+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00101401","sets":["1164:2240:7465:7590"]},"path":["7590"],"owner":"11","recid":"101401","title":["GPUのキャッシュを考慮した疎行列ベクトル積計算手法の性能評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2014-05-19"},"_buckets":{"deposit":"277c4190-4c57-478b-994e-089a78f182a8"},"_deposit":{"id":"101401","pid":{"type":"depid","value":"101401","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"GPUのキャッシュを考慮した疎行列ベクトル積計算手法の性能評価","author_link":["0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"GPUのキャッシュを考慮した疎行列ベクトル積計算手法の性能評価"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"疎行列計算","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2014-05-19","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":"Tokyo Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Tokyo Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Tokyo Institute of Technology","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/101401/files/IPSJ-HPC14144005.pdf"},"date":[{"dateType":"Available","dateValue":"2016-05-19"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-HPC14144005.pdf","filesize":[{"value":"1.2 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":"94554410-ff76-496f-b7c6-cd7d29c15209","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2014 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_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":"巨大な疎行列を係数行列として持つ連立一次方程式を解く際，疎行列ベクトル積計算が実行時間の大部分を占める．GPU などのメニーコアプロセッサはキャッシュ容量が小さいため，入力ベクトル要素へのランダムアクセスによって多数のキャッシュミスが生じる．そのため疎行列ベクトル積計算性能は著しく低い．我々はメニーコア環境においても高いキャッシュヒット率を達成するために，行列を列方向で分割することで各処理内での入力ベクトル要素の再利用性を向上させたフォーマットと疎行列ベクトル積カーネルを新たに提案する．Florida のデータセットから選出した行列に対して既存手法との比較を行った．その結果，疎行列ベクトル積計算について 2.0 倍，CG 法について 1.12 倍の性能向上を果たした．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"9","bibliographic_titles":[{"bibliographic_title":"研究報告ハイパフォーマンスコンピューティング（HPC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2014-05-19","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"2014-HPC-144"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:47:00.622921+00:00","id":101401,"links":{}}