计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (8): 58-61.DOI: 10.3778/j.issn.1002-8331.2009.08.018

• 研究、探讨 • 上一篇    下一篇

异构机群系统上双序列全局比对并行算法

崔 鑫,钟 诚,陆向艳   

  1. 广西大学 计算机与电子信息学院,南宁 530004
  • 收稿日期:2008-01-31 修回日期:2008-04-11 出版日期:2009-03-11 发布日期:2009-03-11
  • 通讯作者: 崔 鑫

Parallel algorithm for pair-wise sequence global alignment on heterogeneous cluster systems

CUI Xin,ZHONG Cheng,LU Xiang-yan   

  1. School of Computer and Electronic Information,Guangxi University,Nanning 530004,China
  • Received:2008-01-31 Revised:2008-04-11 Online:2009-03-11 Published:2009-03-11
  • Contact: CUI Xin

摘要: 对于处理机节点具有不同的计算速度、通信延迟和存储容量的异构机群系统,考虑通信启动开销,基于可分负载理论,提出一种双序列全局比对问题并行处理的最优分配策略,利用该策略确定出并行迭代次数和分配给各个从处理机的子序列长度。异构PC机群系统上的实验结果表明,提出的双序列全局比对并行算法优于基于平均分配策略的并行比对算法,获得良好的加速和可扩展性。

关键词: 双序列比对, 并行算法, 异构机群系统, 可分负载

Abstract: Based on taking into account communication loads and divisible load principle,an optimal pair-wise sequence global alignment distribution strategy is presented on the heterogeneous cluster computing systems that processors have different computing speeds and communication capabilities and memory sizes.This distribution strategy obtains the values of iterations of parallel algorithm and sub-sequence length assigned to every processor on the heterogeneous cluster system.The experimental results on the cluster of heterogeneous personal computers show that the present parallel algorithm for pair-wise sequence global alignment is superior to one with the even distribution strategy,and it obtains good speedup and scalability.

Key words: pair-wise sequence alignment, parallel algorithm, heterogeneous cluster systems, divisible loads