期刊文献+

访存高效并行求解(l,d)-Motif发现问题

Cache-Efficient Parallel Solving(l,d)-Motif Finding Problem
在线阅读 下载PDF
导出
摘要 充分利用多核结构的共享三级缓存、私有二级和一级缓存,将采用Modeling算法求解(l,d)-Motif发现问题过程中产生的大量不同位置组合的数据,以多轮方式调度分配到各级缓存中,通过线程绑定以平衡核心负载,设计实现了一种访存高效的(l,d)-Motif发现线程级并行算法.实验结果表明,与已有的并行求解(l,d)-Motif发现算法相比,本文给出的算法更高效、具有较好的加速比和可扩展性,并且能够成功求解更长l的(l,d)-Motif发现问题. By utilizing fully the shared L3Cache,private L2Cache and L1Cache on the multi-core architecture,the produced large-scale data with the different combination of positions are distributed to the multi-level caches while the Modeling algorithm is used to solve(l,d)-Motif finding problem,and a cache-efficient thread-level parallel(l, d)-Motif finding algorithm is designed on multi-core computer by binding the threads to the cores to balance their computational loads.The experimental results show that,compared with the existing parallel algorithm to solve(l, d)-Motif finding problem,the presented algorithm is efficient and has good speedup and scalability,and it can solve successfully the(l,d)-Motif finding problem with longer l.
出处 《微电子学与计算机》 CSCD 北大核心 2014年第6期97-102,共6页 Microelectronics & Computer
基金 国家自然科学基金项目(60963001) 广西研究生教育创新计划项目(YCSZ2013006) 广西教育厅-广西大学博士点建设基金(P11900119)
关键词 (l d)-Motif发现 Modeling算法 组合计算 多级缓存 线程级并行 (l,d)-Motif finding Modeling algorithm combinational computation multi-level caches thread-level parallelism
  • 相关文献

参考文献4

二级参考文献29

  • 1陈国良.并行算法的可扩放性分析[J].小型微型计算机系统,1995,16(2):10-16. 被引量:12
  • 2李冬冬,王正志,倪青山.一种有效的重复序列识别算法[J].生物信息学,2005,3(4):163-166. 被引量:2
  • 3王晓敏,王正志.基于后缀列的基因序列最大串联重复查找技术(英文)[J].生物信息学,2006,4(2):72-75. 被引量:4
  • 4沈一飞,陈国良,张强峰.基于纳米计算结构上的生物序列模体发现算法[J].小型微型计算机系统,2007,28(4):635-639. 被引量:3
  • 5Benson G. Tandem repeats finder, a program to analyze DNA sequences [J ]. Nucleic Acid Research, 1998 (27) : 573 - 580.
  • 6Sonnhammer E L L, Durbin R. A dot- matrix program with dynamic threshold eontrol suited for genomic DNA and protein sequence analysis [ J ]. Gene, 1995, 167 ( 1/2) : GC1 - GC10.
  • 7Gusfield D,Stoye J. Linear time algorithms for finding and representing all the tandem repeats in a string[ R]. Dept. of Computer Science, University of California, Dvais, 1998.
  • 8Parisi V, Fonzo VD, Aluffi- Pentini F. String: finding tandem repeats in DNA sequences [ J ]. Bioinformaties, 2003,19(14) : 1733 - 1738.
  • 9Karkkainen J, Sanders P. Simple linear work suffix array construction[ C] // Proceedings of Automata, LANGA - GS and Programming. Berlin: Springer- Verlag, 2003: 943 - 955.
  • 10Kasai T, Lee G. Linear- time longest- commonprefix computation in suffix arrays and its applications [ C]// Prec. of Annual Symposium on Combinatorial Pattern Matching. Berlin: Springer- Verlag, 2001: 181- 192.

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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