Thumbnail
Access Restriction
Subscribed

Author Herbordt, Martin C. ♦ Mahram, Atabak
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract The BLAST sequence alignment program is a central application in bioinformatics. The de facto standard version, NCBI BLAST, uses complex heuristics which make it challenging to simultaneously achieve both high performance and exact agreement. In previous work, a system that used novel FPGA-based filters reduced the input database by over 99.97% without loss of sensitivity. In the present work we report experiences in getting from a prototype to a potential product for the Convey HC1-EX. There are several issues. The first is the efforts made to maintain timing for a highly complex configuration as it is optimized by including additional filter stages. This requires implementation and optimization of new interface logic as well as floor-planning. The second is the system-level tradeoffs necessary to maintain correctness. The issue here is preventing low frequency events, which necessarily cannot be mapped to the FPGA, from diluting the performance benefits without sacrificing sensitivity. We present results for various usage scenarios and find a factor of nearly 5x speed-up over a fully parallel implementation of the reference code on a contemporaneous CPU. We believe that the resulting system is the leading accelerated NCBI BLAST. The significance of this work is that, while such in-depth work is necessary to achieve highperformance for complex systems, these issues are rarely described nin the academic literature.
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1981-04-01
Publisher Place New York
Journal ACM SIGARCH Computer Architecture News (CARN)
Volume Number 41
Issue Number 5
Page Count 6
Starting Page 41
Ending Page 46


Open content in new tab

   Open content in new tab
Source: ACM Digital Library