{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00163815","sets":["6504:8291:8748"]},"path":["8748"],"owner":"6748","recid":"163815","title":["Hierarchical Diagonal Blockingを用いた疎行列ベクトル積の特性評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2015-03-17"},"_buckets":{"deposit":"e66172be-ec7e-4e28-a3ad-438123d5e9f3"},"_deposit":{"id":"163815","pid":{"type":"depid","value":"163815","revision_id":0},"owners":[6748],"status":"published","created_by":6748},"item_title":"Hierarchical Diagonal Blockingを用いた疎行列ベクトル積の特性評価","author_link":["321863","321864","321865","321866","321867"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Hierarchical Diagonal Blockingを用いた疎行列ベクトル積の特性評価"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"コンピュータシステム","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2015-03-17","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"工学院大"},{"subitem_text_value":"工学院大"},{"subitem_text_value":"工学院大"},{"subitem_text_value":"工学院大"},{"subitem_text_value":"工学院大"}]},"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/163815/files/IPSJ-Z77-1J-01.pdf","label":"IPSJ-Z77-1J-01.pdf"},"date":[{"dateType":"Available","dateValue":"2016-06-10"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-Z77-1J-01.pdf","filesize":[{"value":"462.1 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"766e5e03-ca4d-4685-bf75-c303433ddf4a","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2015 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"花上, 直樹"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"佐々木, 信一"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"菱沼, 利彰"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"藤井, 昭宏"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"田中, 輝雄"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"大規模物理シミュレーションの核となる反復解法では計算時間の多くを疎行列ベクトル積（SpMV）が占める．疎行列のデータ格納形式の一つに圧縮行格納形式（CRS）がある．CRS形式の問題点として，ベクトル部への参照が非連続の為，キャッシュミスが発生し性能が低下することが知られている．我々は，グラフ分割アルゴリズムを利用して疎行列の要素を並び替えてブロック化し，キャッシュヒット率を改善する疎行列の格納形式，Hierarchical Diagonal Blocking（HDB）に着目した．本研究では，疎行列の構造やサイズの違いに着目し，HDB形式を用いたときの疎行列の分割数を調節することにより，元のCRS形式に対するキャッシュヒット率の向上や性能への効果についての評価を行った．","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"32","bibliographic_titles":[{"bibliographic_title":"第77回全国大会講演論文集"}],"bibliographicPageStart":"31","bibliographicIssueDates":{"bibliographicIssueDate":"2015-03-17","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2015"}]},"relation_version_is_last":true,"weko_creator_id":"6748"},"updated":"2025-01-20T11:07:20.717619+00:00","created":"2025-01-19T00:35:42.749495+00:00","links":{},"id":163815}