【24h】

An approach for high speed homology search with FPGAs

机译:使用FPGA的高速同源性搜索方法

获取原文

摘要

In this paper, we show that we can achieve high performance in homology search by only adding one off-the-shelf PCI board with one Field Programmable Gate Array (FPGA) to a Pentium based computer system in use. By using off-the-shelf boards, we Carl easily obtain latest FPGAs at low costs which is very important because the performance is almost proportional to the vice of the FPGA, and FPGAs are becoming larger and larger following Moore's law. The performance can be furthermore accelerated by using more number of FPGA boards. In our approach, the search is divided into two phases, and different circuits are configured on the FPGA in each phase, its order to make up limited hardware resources of the off-the-shelf boards. The performance is almost comparable with small to middle class dedicated hardware systems when we use a board with one of the latest FPGAs. The computation time is almost proportional to the size of the query sequence. The time for comparing a query sequence of 2,048 elements with a database sequence of 64 millions elements by the Smith-Waterman algorithm is about 34 sec, which is about 330 times faster than a desktop computer with a 1GHz Pentium-III.
机译:在本文中,我们表明,我们可以通过仅与一个现场可编程门阵列(FPGA)到基于奔腾的计算机系统中使用的添加一种现成的,货架PCI板实现在同源性检索高性能。通过使用现成的架子板,我们很容易卡尔获得低成本,这是非常重要的,因为性能已近乎正比于FPGA的恶习,和FPGA最新的FPGA正变得越来越大,随着摩尔定律。性能可通过使用更多FPGA板数量来进一步加速。在我们的方法中,搜索被划分成两个阶段,不同的电路上配置的FPGA中的每个阶段中,其为了弥补所述现成的,搁板的有限的硬件资源。性能是小几乎可以媲美中产阶级专用硬件系统,当我们使用一个板与最新的FPGA之一。计算时间几乎是成正比的查询序列的大小。由Smith-Waterman算法与64个百万元件与数据库序列相比较2048个元件的查询序列的时间是约34秒,这比台式计算机了1GHz的奔腾III快约330倍。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号