基于SUA索引的DNA序列lpr查找GPU加速

Shufang Du, Longjiang Guo, Chunyu Ai, Meirui Ren, Hao Qu, Jinbao Li
{"title":"基于SUA索引的DNA序列lpr查找GPU加速","authors":"Shufang Du, Longjiang Guo, Chunyu Ai, Meirui Ren, Hao Qu, Jinbao Li","doi":"10.1109/PCCC.2014.7017064","DOIUrl":null,"url":null,"abstract":"The repetitions in biological sequence analysis are of great biological significance. Finding the repetitions has been a hot topic in gene projects naturally. In recent years, graphics processing unit (GPU) has been far exceeded the CPU in terms of computing capability and memory bandwidth, especially CUDA dramatically increases in computing performance by harnessing the power of the GPUs. This paper proposes efficient parallel algorithms on CUDA to accelerate finding PTRs which is redefined as LPRs based on the SUA Index. The proposed parallel algorithms have been utilized with the parallel primitives offered by Thrust library and the effective parallel bit compression technology based on division to achieve better acceleration. Optimization techniques include CUDA streams technology are also realized to reduce transmission latency. Experimental results show that the proposed parallel algorithms are faster than the benchmark with 1.6~5.4 speedup.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"GPU acceleration of finding LPRs in DNA sequence based on SUA index\",\"authors\":\"Shufang Du, Longjiang Guo, Chunyu Ai, Meirui Ren, Hao Qu, Jinbao Li\",\"doi\":\"10.1109/PCCC.2014.7017064\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The repetitions in biological sequence analysis are of great biological significance. Finding the repetitions has been a hot topic in gene projects naturally. In recent years, graphics processing unit (GPU) has been far exceeded the CPU in terms of computing capability and memory bandwidth, especially CUDA dramatically increases in computing performance by harnessing the power of the GPUs. This paper proposes efficient parallel algorithms on CUDA to accelerate finding PTRs which is redefined as LPRs based on the SUA Index. The proposed parallel algorithms have been utilized with the parallel primitives offered by Thrust library and the effective parallel bit compression technology based on division to achieve better acceleration. Optimization techniques include CUDA streams technology are also realized to reduce transmission latency. Experimental results show that the proposed parallel algorithms are faster than the benchmark with 1.6~5.4 speedup.\",\"PeriodicalId\":105442,\"journal\":{\"name\":\"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.2014.7017064\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.2014.7017064","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

生物序列分析中的重复序列具有重要的生物学意义。寻找重复序列自然成为基因工程研究的热点。近年来,图形处理单元(GPU)在计算能力和内存带宽方面已经远远超过了CPU,特别是CUDA通过利用GPU的强大功能大大提高了计算性能。本文在CUDA上提出了一种高效的并行算法来加速查找基于SUA索引的ptr,并将其重新定义为lpr。利用Thrust库提供的并行基元和基于除法的有效并行位压缩技术,所提出的并行算法获得了较好的加速效果。优化技术还包括CUDA流技术,以减少传输延迟。实验结果表明,所提并行算法的速度比基准算法快1.6~5.4。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
GPU acceleration of finding LPRs in DNA sequence based on SUA index
The repetitions in biological sequence analysis are of great biological significance. Finding the repetitions has been a hot topic in gene projects naturally. In recent years, graphics processing unit (GPU) has been far exceeded the CPU in terms of computing capability and memory bandwidth, especially CUDA dramatically increases in computing performance by harnessing the power of the GPUs. This paper proposes efficient parallel algorithms on CUDA to accelerate finding PTRs which is redefined as LPRs based on the SUA Index. The proposed parallel algorithms have been utilized with the parallel primitives offered by Thrust library and the effective parallel bit compression technology based on division to achieve better acceleration. Optimization techniques include CUDA streams technology are also realized to reduce transmission latency. Experimental results show that the proposed parallel algorithms are faster than the benchmark with 1.6~5.4 speedup.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Performance and energy evaluation of RESTful web services in Raspberry Pi Proximity-driven social interactions and their impact on the throughput scaling of wireless networks POLA: A privacy-preserving protocol for location-based real-time advertising Replica placement in content delivery networks with stochastic demands and M/M/1 servers Combinatorial JPT based on orthogonal beamforming for two-cell cooperation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1