Yamaguchi Yoshiki, Maruyama Tsutomu, Konagaya Akihiko
Institute of Engineering Mechanics and Systems, University of Tsukuba, 1-1-1 Ten-ou-dai, Tsukuba, Ibaraki, 305-8573, Japan.
Pac Symp Biocomput. 2002:271-82.
We will introduce a way how we can achieve high speed 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. FPGA is a reconfigurable device, and any kind of circuits, such as pattern matching program, can be realized in a moment. The performance is almost proportional to the size of FPGA which is used in the system, and FPGAs are becoming larger and larger following Moore's law. We can easily obtain latest/larger FPGAs in the form off-the-shelf PCI boards with FPGAs, at low costs. The result which we obtained is as follows. The performance is most comparable with small to middle class dedicated hardware systems when we use a board with one of the latest FPGAs and the performance can be furthermore accelerated by using more number of FPGA boards. The time for comparing a query sequence of 2,048 elements with a database sequence of 64 million elements by the Smith-Waterman algorithm is about 34 sec, which is about 330 times faster than a desktop computer with a 1 GHz Pentium III. We can also accelerate the performance of a laptop computer using a PC card with one smaller FPGA. The time for comparing a query sequence (1,024) with the database sequence (64 million) is about 185 sec, which is about 30 times faster than the desktop computer.
我们将介绍一种方法,通过仅在现有的基于奔腾的计算机系统中添加一块带有一个现场可编程门阵列(FPGA)的现成PCI板,就能实现高速同源性搜索。FPGA是一种可重构设备,任何类型的电路,比如模式匹配程序,都能瞬间实现。其性能几乎与系统中使用的FPGA大小成正比,并且随着摩尔定律,FPGA正变得越来越大。我们可以很容易地以带有FPGA的现成PCI板的形式,低成本获得最新/更大的FPGA。我们得到的结果如下。当我们使用一块带有最新FPGA之一的板时,性能与中低端专用硬件系统最具可比性,并且通过使用更多数量的FPGA板,性能还能进一步提升。使用史密斯-沃特曼算法将一个2048个元素的查询序列与一个6400万个元素的数据库序列进行比较的时间约为34秒,这比一台配备1GHz奔腾III的台式计算机快约330倍。我们还可以使用一块带有较小FPGA的PC卡来提升笔记本电脑的性能。将一个查询序列(1024个元素)与数据库序列(6400万个元素)进行比较的时间约为185秒,这比台式计算机快约30倍。