This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Network-on-Chip Hardware Accelerators for Biological Sequence Alignment
January 2010 (vol. 59 no. 1)
pp. 29-41
Souradip Sarkar, Washington State University, Pullman
Gaurav Ramesh Kulkarni, Washington State University, Pullman
Partha Pratim Pande, Washington State University, Pullman
Ananth Kalyanaraman, Washington State University, Pullman
The most pervasive compute operation carried out in almost all bioinformatics applications is pairwise sequence homology detection (or sequence alignment). Due to exponentially growing sequence databases, computing this operation at a large-scale is becoming expensive. An effective approach to speed up this operation is to integrate a very high number of processing elements in a single chip so that the massive scales of fine-grain parallelism inherent in several bioinformatics applications can be exploited efficiently. Network-on-Chip (NoC) is a very efficient method to achieve such large-scale integration. In this work, we propose to bridge the gap between data generation and processing in bioinformatics applications by designing NoC architectures for the sequence alignment operation. Specifically, we 1) propose optimized NoC architectures for different sequence alignment algorithms that were originally designed for distributed memory parallel computers and 2) provide a thorough comparative evaluation of their respective performance and energy dissipation. While accelerators using other hardware architectures such as FPGA, General Purpose Graphics Processing Unit (GPU), and the Cell Broadband Engine (CBE) have been previously designed for sequence alignment, the NoC paradigm enables integration of a much larger number of processing elements on a single chip and also offers a higher degree of flexibility in placing them along the die to suit the underlying algorithm. The results show that our NoC-based implementations can provide above 10^2\hbox{-}10^3-fold speedup over other hardware accelerators and above 10^4-fold speedup over traditional CPU architectures. This is significant because it will drastically reduce the time required to perform the millions of alignment operations that are typical in large-scale bioinformatics projects. To the best of our knowledge, this work embodies the first attempt to accelerate a bioinformatics application using NoC.

[1] Benson et al., “GenBank,” Nucleic Acids Research, vol. 35, pp. D21-D25, 2007.
[2] T.F. Smith and M.S. Waterman, “Identification of Common Molecular Subsequences,” J. Molecular Biology, vol. 147, pp. 195-197, 1981.
[3] S.B. Needleman and C.D. Wunsch, “A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins,” J. Molecular Biology, vol. 48, pp. 443-453, 1970.
[4] S. Yooseph et al., “The Sorcerer II Global Ocean Sampling Expedition: Expanding the Universe of Protein Families,” Public Library of Science Biology, vol. 5, no. 3, 2007, doi:10.1371/journal. pbio.0050016.
[5] J. Thompson et al., “CLUSTALW: Improving the Sensitivity of Progressive Multiple Sequence Alignment through Sequence Weighting, Position-Specific Gap Penalties and Weight Matrix Choice,” Nucleic Acids Research, vol. 22, pp. 4673-4680, 1994.
[6] S. Dydel and P. Bala, “Large Scale Protein Sequence Alignment Using FPGA Reprogrammable Logic Devices,” Proc. Conf. Field-Programmable Logic and Its Applications, pp. 23-32. 2004.
[7] T. Oliver et al., “Using Reconfigurable Hardware to Accelerate Multiple Sequence Alignment with ClustalW,” Bioinformatics, vol. 21, no. 16, pp. 3431-3432, 2005.
[8] W. Liu, B. Schmidt, G. Voss, and W. Mueller-Wittig, “Streaming Algorithms for Biological Sequence Alignment on GPUs,” IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 9, pp. 1270-1281, June 2007.
[9] V. Sachdeva et al., “Exploring the Viability of the Cell Broadband Engine for Bioinformatics Applications,” Parallel Computing, vol. 34, no. 11, pp. 616-626, 2008.
[10] A. Sarje and S. Aluru, “Parallel Biological Sequence Alignments on the Cell Broadband Engine,” Proc. IEEE Int'l Parallel and Distributed Processing Symp., 2008.
[11] S. Vangal et al., “An 80-Tile Sub-100-W TeraFLOPS Processor in 65-nm CMOS,” IEEE J. Solid State Circuits, vol. 43, no. 1, pp. 29-41, Jan. 2008.
[12] I.A. Khatib et al., “A Multiprocessor System-on-Chip for Real-Time Biomedical Monitoring and Analysis: Architectural Design Space Exploration,” Proc. IEEE Design Automation Conf. (DAC), pp.125-130, July 2006.
[13] L. Benini and G. De Micheli, “Networks on Chips: A New SoC Paradigm,” Computer, vol. 35, no. 1, pp. 70-78, Jan. 2002.
[14] P.P. Pande et al., “Performance Evaluation and Design Trade-Offs for Network on Chip Interconnect Architectures,” IEEE Trans. Computers, vol. 54, no. 8, pp. 1025-1040, Aug. 2005.
[15] S. Aluru et al., “Parallel Biological Sequence Comparison Using Prefix Computations,” J. Parallel and Distributed Computing, vol. 63, pp. 264-272, 2003.
[16] E.W. Edmiston and R.A. Wagner, “Parallelization of the Dynamic Programming Algorithm for Comparison of Sequences,” Proc. Int'l Conf. Parallel Processing, pp. 78-80, 1987.
[17] X. Huang, “A Space-Efficient Parallel Sequence Comparison Algorithm for a Message-Passing Multiprocessor,” Int'l J. Parallel Programming, vol. 18, no. 3, pp. 223-239, 1989.
[18] S. Rajko and S. Aluru, “Space and Time Optimal Parallel Sequence Alignments,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 12, pp. 1070-1081, Dec. 2004.
[19] O. Gotoh, “An Improved Algorithm for Matching Biological Sequences,” J. Molecular Biology, vol. 162, pp. 705-708, 1982.
[20] A. Apostolico et al., “Efficient Parallel Algorithms for String Editing and Related Problems,” SIAM J. Computing, vol. 19, no. 5, pp. 968-988, 1990.
[21] D. Gusfield, Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge Univ. Press, 1997.
[22] D.S. Hirschberg, “A Linear Space Algorithm for Computing Maximal Common Subsequences,” Comm. ACM, vol. 18, no. 6, pp.341-343, 1975.
[23] A.R. Butz, “Alternative Algorithm for Hilbert's Space Filling Curve,” IEEE Trans. Computers, vol. 20, no. 4, pp. 424-426, Apr. 1971.
[24] J.M. Rabaey et al., Digital Integrated Circuits: A Design Perspective. Prentice Hall, 2003.
[25] J. Kim et al., “Flattened Butterfly Topology for On-Chip Networks,” IEEE Computer Architecture Letters, vol. 6, no. 2, pp. 37-40, July-Dec. 2007.
[26] F. Sanger et al., “Nucleotide Sequence of Bacteriophage Lambda DNA,” J. Molecular Biology, vol. 162, pp. 729-773, 1982.
[27] M.O. Dayhoff, R.M. Schwartz, and B.C. Orcutt, “A Model of Evolutionary Change in Proteins,” Atlas of Protein Sequence and Structure, vol. 5, no. 3, pp. 345-352, Nat'l Biomedical Research Foundation, 1978.
[28] S.F. Altschul et al., “Basic Local Alignment Search Tool,” J.Molecular Biology, vol. 215, pp. 403-410, 1990.

Index Terms:
Network-on-chip, bioinformatics, DNA/protein sequence alignment, on-chip parallelism, hardware acceleration.
Citation:
Souradip Sarkar, Gaurav Ramesh Kulkarni, Partha Pratim Pande, Ananth Kalyanaraman, "Network-on-Chip Hardware Accelerators for Biological Sequence Alignment," IEEE Transactions on Computers, vol. 59, no. 1, pp. 29-41, Jan. 2010, doi:10.1109/TC.2009.133
Usage of this product signifies your acceptance of the Terms of Use.