{"updated":"2025-01-21T21:36:54.710997+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00074410","sets":["6164:6165:6426:6428"]},"path":["6428"],"owner":"11","recid":"74410","title":["GPUを使用したビット並列アルゴリズムに基く最長共通部分列の導出"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-05-18"},"_buckets":{"deposit":"9831fc63-b32f-4662-b505-65d8a967bf59"},"_deposit":{"id":"74410","pid":{"type":"depid","value":"74410","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"GPUを使用したビット並列アルゴリズムに基く最長共通部分列の導出","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"GPUを使用したビット並列アルゴリズムに基く最長共通部分列の導出"},{"subitem_title":"Computing the Longest Common Subsequence with Bit-Parallelism on a GPU","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"GPU","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2011-05-18","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪府立大学大学院理学系研究科情報数理科学専攻"},{"subitem_text_value":"大阪府立大学大学院理学系研究科情報数理科学専攻"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Mathematics and Information Sciences, Graduate School of Science, Osaka Prefecture University","subitem_text_language":"en"},{"subitem_text_value":"Department of Mathematics and Information Sciences, Graduate School of Science, Osaka Prefecture University","subitem_text_language":"en"}]},"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/74410/files/IPSJ-SACSIS2011072.pdf"},"date":[{"dateType":"Available","dateValue":"2013-05-18"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SACSIS2011072.pdf","filesize":[{"value":"810.6 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"330","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"330","billingrole":"16"},{"tax":["include_tax"],"price":"330","billingrole":"11"},{"tax":["include_tax"],"price":"330","billingrole":"14"},{"tax":["include_tax"],"price":"330","billingrole":"15"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"8b77c7f2-6cc0-4f03-815b-e54ba41d60b3","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"河南, 克也"},{"creatorName":"藤本, 典幸"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Katsuya, Kawanami","creatorNameLang":"en"},{"creatorName":"Noriyuki, Fujimoto","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"2 つの文字列の最長共通部分列を求める LCS 計算は遺伝子の比較などの様々な応用を持つ．本論文では Crochemore らのビット並列アルゴリズムを用いて改善した Hirschberg の CPU 用 LCS アルゴリズムを，GPU を用いて高速化する方法を提案する．Crochemore らのアルゴリズムは 1 ビット毎に同時並列実行が可能なビット毎の論理演算の他に，逐次性が強い算術加算など，GPU での実装に工夫が必要な演算も含んでいる．本論文では特にそれらの演算の効率的な実装方法について論じる．その方法に基いて設計したプログラムを，2.93GHz Intel Core i3 530 CPU とGeForce 8800 GTX，GTX 285，GTX 480 GPU を用いて評価した結果，CPU 上でのビット並列アルゴリズムに対しては最大 12.77 倍，Hirschberg の CPU 用 LCS アルゴリズムに対しては最大 76.5 倍高速であった．また，Kloetzli らの GPU を用いた既存アルゴリズムに対しては 10.9 倍から 18.1 倍高速であった．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The longest common subsequence (LCS for short) for given two strings has various applications, e.g. comparison of DNAs. In this paper, we propose a GPU algorithm to accelerate Hirschberg's CPU LCS algorithm improved using Crochemore et al's bit-parallel CPU algorithm. Crochemore's algorithm includes bitwise logical operators which can be computed in embarrassingly parallel. However, it also includes some operators with less parallelism, e.g. an arithmetic sum. In this paper, we focus on how to implement these operators efficiently in parallel. Our experiments with 2.93GHz Intel Core i3 530 CPU, GeForce 8800 GTX, GTX 285, and GTX 480 GPUs show that the proposed algorithm runs maximum 12.77 times faster than the bit-parallel CPU algorithm and maximum 76.5 times faster than Hirschberg's LCS CPU algorithm. Furthermore, the proposed algorithm runs 10.9 to 18.1 times faster than Kloetzli's existing GPU algorithm.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"372","bibliographic_titles":[{"bibliographic_title":"先進的計算基盤システムシンポジウム論文集"}],"bibliographicPageStart":"365","bibliographicIssueDates":{"bibliographicIssueDate":"2011-05-18","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2011"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:31:57.539250+00:00","id":74410,"links":{}}