A parameterisable and scalable Smith-Waterman algorithm implementation on CUDA-compatible GPUs
スポンサーリンク
概要
- 論文の詳細を見る
2009 IEEE 7th Symposium on Application Specific Processors (SASP) : San Francisco, CA, USA, 2009.07.27-2009.07.28This paper describes a multi-threaded parallel design and implementation of the Smith-Waterman (SM) algorithm on compute unified device architecture (CUDA)-compatible graphic processing units (GPUs). A novel technique has been put forward to solve the restriction on the length of the query sequence in previous GPU implementations of the Smith-Waterman algorithm. The main reasons behind this limitation in previous GPU implementations were the finite size of local memory and number of threads per block. Our solution to this problem uses a divide and conquer approach to compute the alignment matrix involved in each pairwise sequence alignment, as it divides the entire matrix computation into multiple sub-matrices and allocates the available amount of threads and memory resources to each submatrix iteratively. Intermediate data is stored in shared and global memory on the fly depending on the length of sequences in hand. The proposed technique resulted in up to 4.2 GCUPS (Giga Cell Updates per Second) performance when tested against the SWISS-PROT protein database, which is up to 15 times faster than a equivalent optimised CPU-only implementation running on a Pentium4 3.4GHz desktop computer. Moreover, our implementation can cope with any query or subject sequence size, unlike previously reported GPU implementations of the Smith-Waterman algorithm which makes it fully deployable in real world bioinformatics applications.
論文 | ランダム
- 日本を徘徊する「表現の自由」という名の巨大な妖怪 「表現の自由」と情報環境破壊(3)
- 日本を徘徊する「表現の自由」という名の巨大な妖怪(2)「表現の自由」と情報環境破壊
- 株価操作「キャッツ事件」の闇--「東京相和銀行」の亡霊たちが徘徊し出した
- 日本を徘徊する「表現の自由」という名の巨大な妖怪
- それでもなお、上海徘徊のすすめ (特集 上海モダン)