Efficient Parallelization and Optimization of Protein Sequence Comparison Algorithm on Many-Core Architecture
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    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.

    Reference
    Related
    Cited by
Get Citation

叶笑春,林伟,范东睿,张浩.蛋白质序列比对算法在众核结构上的并行优化.软件学报,2010,21(12):3094-3105

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:September 23,2008
  • Revised:April 27,2009
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063