首页 | 本学科首页   官方微博 | 高级检索  
     

一种面向生物信息学的可重构加速卡的设计与实现
引用本文:张佩珩,刘新春,江先阳. 一种面向生物信息学的可重构加速卡的设计与实现[J]. 计算机研究与发展, 2005, 42(6): 930-937
作者姓名:张佩珩  刘新春  江先阳
作者单位:中国科学院计算技术研究所,北京,100080;中国科学院计算技术研究所,北京,100080;中国科学院计算技术研究所,北京,100080
基金项目:中国科学院知识创新工程重要方向性基金项目(KSCX2SW223),国家自然科学基金项目(60373044)
摘    要:人类基因组测序工作完成后,对基因数据的处理和分析能力提出了更高的要求.生物信息学的基本研究方法之一就是计算,其算法的特点是数据量较大、算法比较简单、运算类型单一、重复性较强、潜在的并行度较高.用现有的大规模并行机或超级服务器等通用系统解决这些问题,既浪费系统的资源,使用维护也比较复杂,有些问题甚至无法在限定的时间内完成.提出了一种。比较通用的算法可重构硬件加速卡的体系结构,以全局Smith-Waterman算法为例,阐述了从算法到硬件实现的映射过程,并指出了将其他类型算法映射到该加速卡上的可行性.

关 键 词:全局Smith-Waterman算法  可重构  硬件加速卡  FPGA

An Implementation of Reconfigurable Computing Accelerator Card Oriented Bioinformatics
Zhang Peiheng,Liu Xinchun,Jiang Xianyang. An Implementation of Reconfigurable Computing Accelerator Card Oriented Bioinformatics[J]. Journal of Computer Research and Development, 2005, 42(6): 930-937
Authors:Zhang Peiheng  Liu Xinchun  Jiang Xianyang
Abstract:After the completion of human genome sequencing, the biologists require higher processing and analysis power to handle the huge gene data. Computing is a basic research method of bioinformatics, many bioinformatics programs have some common features, such as huge data volume, relative simple algorithm, few operation types, many repeating processes, showing that these programs are potentially parallelizable. When running in a general computer, these programs not only waste a lot of system resources, but also need complex maintenance. However, a lot of program still couldn't get a satisfying result within limited time. A kind of general algorithm-reconfigurable hardware accelerator architecture is presented, the principle of how to map the global Smith-Waterman algorithm to the hardware is discussed and its possible applications in other fields are pointed out.
Keywords:global Smith-Waterman algorithm  reconfigurable  hardware accelerator card  FPGA
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号