GPU-Meta-Storms: Computing the similarities among massive microbial communities using GPU

Xiaoquan Su, Xuetao Wang, Jian Xu, K. Ning
{"title":"GPU-Meta-Storms: Computing the similarities among massive microbial communities using GPU","authors":"Xiaoquan Su, Xuetao Wang, Jian Xu, K. Ning","doi":"10.1109/ISB.2013.6623796","DOIUrl":null,"url":null,"abstract":"With the development of next-generation sequencing and metagenomic technologies, the number of metagenomic samples of microbial communities is increasing with exponential speed. The comparison among metagenomic samples could facilitate the data mining of the valuable yet hidden biological information held in the massive metagenomic data. However, current methods for metagenomic comparison are limited by their ability to process very large number of samples each with large data size. In this work, we have developed an optimized GPU-based metagenomic comparison algorithm, GPU-Meta-Storms, to evaluate the quantitative phylogenetic similarity among massive metagenomic samples, and implemented it using CUDA (Compute Unified Device Architecture) and C++ programming. The GPU-Meta-Storms program is optimized for CUDA with non-recursive transform, register recycle, memory alignment and so on. Our results have shown that with the optimization of the phylogenetic comparison algorithm, memory accessing strategy and parallelization mechanism on many-core hardware architecture, GPU-Meta-Storms could compute the pair-wise similarity matrix for 1920 metagenomic samples in 4 minutes, which gained a speed-up of more than 1000 times compared to CPU version Meta-Storms on single-core CPU, and more than 100 times on 16-core CPU. Therefore, the high-performance of GPU-Meta-Storms in comparison with massive metagenomic samples could thus enable in-depth data mining from massive metagenomic data, and make the real-time analysis and monitoring of constantly-changing metagenomic samples possible.","PeriodicalId":151775,"journal":{"name":"2013 7th International Conference on Systems Biology (ISB)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 7th International Conference on Systems Biology (ISB)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISB.2013.6623796","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

With the development of next-generation sequencing and metagenomic technologies, the number of metagenomic samples of microbial communities is increasing with exponential speed. The comparison among metagenomic samples could facilitate the data mining of the valuable yet hidden biological information held in the massive metagenomic data. However, current methods for metagenomic comparison are limited by their ability to process very large number of samples each with large data size. In this work, we have developed an optimized GPU-based metagenomic comparison algorithm, GPU-Meta-Storms, to evaluate the quantitative phylogenetic similarity among massive metagenomic samples, and implemented it using CUDA (Compute Unified Device Architecture) and C++ programming. The GPU-Meta-Storms program is optimized for CUDA with non-recursive transform, register recycle, memory alignment and so on. Our results have shown that with the optimization of the phylogenetic comparison algorithm, memory accessing strategy and parallelization mechanism on many-core hardware architecture, GPU-Meta-Storms could compute the pair-wise similarity matrix for 1920 metagenomic samples in 4 minutes, which gained a speed-up of more than 1000 times compared to CPU version Meta-Storms on single-core CPU, and more than 100 times on 16-core CPU. Therefore, the high-performance of GPU-Meta-Storms in comparison with massive metagenomic samples could thus enable in-depth data mining from massive metagenomic data, and make the real-time analysis and monitoring of constantly-changing metagenomic samples possible.
GPU- meta - storms:使用GPU计算大量微生物群落之间的相似性
随着新一代测序和宏基因组技术的发展,微生物群落宏基因组样本数量呈指数级增长。通过宏基因组样本间的比较,可以方便地挖掘海量宏基因组数据中蕴藏的有价值但又隐藏的生物信息。然而,目前的宏基因组比较方法受到处理大量样本的能力的限制,每个样本的数据量都很大。在这项工作中,我们开发了一种优化的基于gpu的宏基因组比较算法GPU-Meta-Storms,用于评估大量宏基因组样本之间的定量系统发育相似性,并使用CUDA(计算统一设备架构)和c++编程实现。GPU-Meta-Storms程序针对CUDA进行了非递归变换、寄存器回收、内存对齐等优化。研究结果表明,通过优化多核硬件架构上的系统发育比较算法、内存访问策略和并行化机制,GPU-Meta-Storms可以在4分钟内计算出1920个元基因组样本的配对相似矩阵,与CPU版本的Meta-Storms相比,在单核CPU上的速度提高了1000倍以上,在16核CPU上的速度提高了100倍以上。因此,与海量宏基因组样本相比,GPU-Meta-Storms的高性能可以实现对海量宏基因组数据的深度数据挖掘,使对不断变化的宏基因组样本的实时分析和监测成为可能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信