期刊文献+

蛋白质序列比对算法在众核结构上的并行优化 被引量:3

Efficient Parallelization and Optimization of Protein Sequence Comparison Algorithm on Many-Core Architecture
在线阅读 下载PDF
导出
摘要 在生物信息学中,蛋白质序列比对是最为重要的算法之一,生物技术的发展使得已知的序列库变得越来越庞大,这类算法本身又具有计算密集型的特点,这导致进行序列比对所消耗的时间也越来越长,目前的单核或者数量较少的多核系统均已经难以满足对计算速度的要求.Godson-T是一个包含诸多创新结构的众核平台,在该系统上实现了对一种蛋白质序列比对算法的并行化,并且结合蛋白质比对算法以及Godson-T结构的特征,针对同步开销、存储访问竞争以及负载均衡3个方面对算法进行了细致的优化,最终并行部分整体也获得了更优的、接近线性的加速比,并且实际性能远远优于基于AMD Opteron处理器的工作站平台. In bioinformatics, a protein sequence comparison between two banks is one of most important algorithms. The sequence bank size is becoming larger and larger with the development of biotechnology, while the algorithm is also computation intensive. This leads to more and more consumption time and the single processor or multicore system, with only a few cores, are not powerful enough to reach a satisfying speed nowadays. Godson-T is a new kind of many-core architecture with lots of novel features. The parallelization of a protein sequence comparison algorithm on Godson-T is implemented. At the same time, the algorithm structure and architecture features of Godson-T are combined, and some optimization in three aspects are made: synchronization overhead, memory access contention, and load balance. The result shows that a close to linear speedup is obtained, and the performance is much better than that of the workstation platform based on the AMD Opteron processor.
出处 《软件学报》 EI CSCD 北大核心 2010年第12期3094-3105,共12页 Journal of Software
基金 国家自然科学基金No.60736012 国家重点基础研究发展计划(973)No.2005CB321600~~
关键词 序列比对算法 众核 并行 优化 sequence comparison algorithm many-core parallelization optimization
  • 相关文献

参考文献4

二级参考文献55

  • 1Huang He, Yuan Nan, Lin Wei et al. Architecture supported synchronization-based cache coherence protocol for manycore Processors//Proceedings of the ISCA Workshop on Chip Multiprocessor Memory Systems and Interconnects. Beijing, China, 2008:51-53
  • 2Asanovic Krste, Bodik Ras et al. The landscape of parallel computing research: A view from Berkeley. University of California, California, USA: Technical Report UCB/EECS- 2006-183, 2006
  • 3Culler David E, Singh Jaswinder Pal, Gupta Anoop. Parallel Computer Architecture: A Hardware/Software Approach. San Fransisco, USA: Morgan Kaufmann, 1998
  • 4Iftode Liviu, Singh Jaswinder Pal, Li Kai. Scope consistency: A bridge between release consistency and entry consistency//Proceedings of the 8th Annual ACM Symposium on Par allel Algorithms and Architectures. Padua, Italy, 1996: 277-287
  • 5Karp A H, Sarkar Vivek. Data merging for shared-memory multiprocessors//Proceedings of the 26th Hawaii International Conference on System Sciences. Hawaii, USA, 1993: 244-256
  • 6Lenoski Daniel, Laudon James, Joe Truman et al. The dash prototype: Implementation and performance//Proceedings of the 19th International Symposium on Computer Architecture. Queensland, Australia, 1992; 92-103
  • 7Lamport Leslie. How to make a multiprocessor computer that correctly executes multiproeess program. IEEE Transactions on Computers, 1979, 28(9): 690-691
  • 8Adve Sarita V, Hill Mark D. Weak ordering-A new definition//Proeeedings of the 17th International Symposium on Computer Architecture. Seattle, USA, 1990:2-14
  • 9Gharachorloo Kourosh, Lenoski Daniel et al. Memory consistency and event ordering in scalable shared-memory multiprocessors//Proceedings of the 17th International Symposium on Computer Architecture. Seattle, USA, 1990:15-26
  • 10del Cuvillo Juan, Zhu Wei-Rong et al. Toward a software infrastructure for the cyclops-64 cellular architecture//Proceedings of the 20th International Symposium on High-Performance Computing in an Advanced Collaborative Environment. St. John's, Canada, 2006:9-20

共引文献14

同被引文献73

  • 1刘立芳,霍红卫,王宝树.PHGA-COFFEE:多序列比对问题的并行混合遗传算法求解[J].计算机学报,2006,29(5):727-733. 被引量:11
  • 2周红.基于deBruiin图的DNA多序列比对并行算法研究[D].天津:天津大学,2011.
  • 3GenBank. Growth of GenBank and WGS [DB/OL]. http:// www. ncbi. nlm. nih. gov/genbank/statistics, 2013.
  • 4Ali Khajeh-Saeed, Stephen Poole, J Blair Perot. Acceleration of the Smith-Waterman algorithm using single and multiple graphics processors [J].Journal of ComputationaI Physics, 2010, 229 (11): 4247-4258.
  • 5Lars Wienbrandt, Stefan Baumgart, Jost Bissel, et al. Mas- sively parallel FPGA-based implementation of BLASTp with the two-hit method [C] //Proceedings of the International Confe- rence on Computational Science, 2011 : 1967-1976.
  • 6Cheng Ling, Khaled Benkrid. Design and implementation of a CUDA-compatible GPU-based core for gapped BLAST algo- rithm [C] //Proceedings of the International Conference onComputational Science, 2010.. 495-504.
  • 7Baomin Xu, Jin Gao, Chunyan Li. An efficient algorithm for DNA fragment assembly in MapReduce [J]. Bioche:ical and Biophysical Research Communications, 2012, 426 (3): 395-398.
  • 8张忆.基于遗传退火的生物信息学多序列比对算法研究[D].成都:电子科技大学,2006.
  • 9Chengpeng Bi. Deterministic local alignment methods im- proved by a simple genetic algorithm [J]. Neurocomputing, 2010, 73 (13): 2394-2406.
  • 10Jacek Blazewicz, Wo]eieeh Frohmberg, Michal Kierzynka, et al. G-MSA--A GPU-based, fast and accurate algorithm for multiple sequence alignment [J]. Journal of Parallel and Dis tributedComputing, 2013, 73 (1)., 32-41.

引证文献3

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部