Skip to main content

A New Parallel Method of Smith-Waterman Algorithm on a Heterogeneous Platform

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6081))

Abstract

Smith-Waterman algorithm is a classic dynamic programming algorithm to solve the problem of biological sequence alignment. However, with the rapid increment of the number of DNA and protein sequences, the originally sequential algorithm is very time consuming due to there existing the same computing task computed repeatedly on large-scale data. Today’s GPU (graphics processor unit) consists of hundreds of processors, so it has a more powerful computation capacity than the current multicore CPU . And as the programmability of GPU improved continuously, using it to do generous purpose computing is becoming very popular. In order to accelerate sequence alignment, previous researchers use the parallelism of the anti-diagonal of similarity matrix to parallelize the Smith-Waterman algorithm on GPU . In this paper, we design a new parallel algorithm which exploits the parallelism of the column of similarity matrix to parallelize the Smith-Waterman algorithm on a heterogeneous system based on CPU and GPU . The experiment result shows that our new parallel algorithm is more efficient than that of previous, which takes full advantage of the features of both the CPU and GPU and obtains approximately 37 times speedup compared with the sequential algorithm named OSEARCH implemented on Intel dual-core E2140 processor.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Yu, L., Xu, Y.: A Parallel Gibbs Sampling Algorithm for Motif Finding on GPU. In: 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, pp. 555–558 (2009)

    Google Scholar 

  2. Horn, D., Houston, M., Hanrahan, P.: ClawHMMer: A Streaming HMMer-Search Implementation. In: Proc. ACM/IEEE Conf. Supercomputing, SC 2005 (2005)

    Google Scholar 

  3. Liu, W., Schmidt, B., Voss, G.: Bio-Sequence Database Scanning on a GPU. In: Proc. 20th IEEE Int’l Parallel and Distributed Processing Symp (High Performance Computational Biology (HiCOMB) Workshop) (2006)

    Google Scholar 

  4. Liu, W., Schmidt, B., Voss, G.: GPUClustalW: Using Graphics Hardware to Accelerate Multiple Sequence Alignment. In: Proc. 13th Ann. IEEE Int’l Conf. High Performance Computing (HiPC 2006), pp. 363–374 (2006)

    Google Scholar 

  5. NVidia CUDA, http://www.nvidia.com/cuda

  6. Smith, T., Waterman, M.: Identification of Common Molecular Subsequences. J. Molecular Biology 147, 195–197 (1981)

    Article  Google Scholar 

  7. Liu, W., Schmidt, B., Voss, G.: Streaming algorithms for biological sequence alignment on GPUs. IEEE Trans. Parallel and Distributed Systems 18(9), 1270–1281 (2007)

    Article  Google Scholar 

  8. Ino, F., Kotani, Y., Hagihara, K.: Harnessing the Power of idle GPUs for Acceleration of Biological Sequence Alignment. In: IEEE International Symposium on Parallel & Distributed Processing, 2009. IPDPS 2009, pp. 1–8 (2009)

    Google Scholar 

  9. Pearson, W.R.: Searching protein sequence libraries: comparison of the sensitivity and selectivity of the Smith and Waterman and FASTA algorithms. Genomics 11, 635–650 (1991)

    Article  Google Scholar 

  10. Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: Basic local alignment search tool. J. Mol. Biol. 215, 403–410 (1990)

    Google Scholar 

  11. NVIDIA Corporation. CUDA Programming Guide Version 2.0 (July 2008)

    Google Scholar 

  12. Owens, J.: HCW 2009 keynote talk: GPU computing: Heterogeneous computing for future systems. In: IEEE International Symposium on Parallel & Distributed Processing, IPDPS 2009, pp. 1–1 (2009)

    Google Scholar 

  13. Ryoo, S., Rodrigues, C.I., Stone, S.S., Stratton, J.A., Ueng, S.-Z., Baghsorkhi, S.S., Hwu, W.-m.W.: Program optimization carving for GPU computing. J. Parallel Distrib. Comput., 1389–1401 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, B., Xu, Y., Yang, J., Jiang, H. (2010). A New Parallel Method of Smith-Waterman Algorithm on a Heterogeneous Platform. In: Hsu, CH., Yang, L.T., Park, J.H., Yeo, SS. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2010. Lecture Notes in Computer Science, vol 6081. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13119-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13119-6_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13118-9

  • Online ISBN: 978-3-642-13119-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics