Abstract
An approach allowing us to improve the locality of a parallel Needleman-Wunsch (NW) global sequence alignment algorithm is proposed. The original NW algorithm works with an arbitrary gap penalty function and examines all possible gap lengths. To compute the score of an element of an NW array, cells gap symbols are looked back over entire row and column as well as one adjacent cell. We modified the NW algorithm so to read cells only with the row-major order by means of forming a copy of the transposed scoring array. The loop skewing technique is used to generate parallel code. A formal parallel NW algorithm is presented. Experimental results demonstrate super-linear speed-up factor of the accelerated code due to considerable increasing code locality on a studied modern multi-core platform.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
To depict two time lines with large disparities, we used a logarithmic time axis.
References
de Almeida, T.J.B.M., Roma, N.F.V.: A parallel programming framework for multi-core DNA sequence alignment. In: International Conference on Complex, Intelligent and Software Intensive Systems, pp. 907–912, February 2010
Altschul, S.F., Gish, W., Miller, W., Myers, E., Lipman, D.: A basic local alignment search tool. J. Mol. Biol. 215, 403–410 (1990)
Bielecki, W., Palkowski, M.: Perfectly nested loop tiling transformations based on the transitive closure of the program dependence graph. Soft Comput. Comput. Inf. Sci. 342, 309–320 (2015)
Bondhugula, U., Hartono, A., Ramanujam, J., Sadayappan, P.: A practical automatic polyhedral parallelizer and locality optimizer. SIGPLAN Not. 43(6), 101–113 (2008)
Chang, D.J., Kimmer, C., Ouyang, M.: Accelerating the Nussinov RNA folding algorithm with CUDA/GPU. In: 10th IEEE International Symposium on Signal Processing and Information Technology, pp. 120–125, December 2010
Li, J., Ranka, S., Sahni, S.: Multicore and GPU algorithms for Nussinov RNA folding. BMC Bioinform. 15(8), S1 (2014). https://doi.org/10.1186/1471-2105-15-S8-S1
Needleman, S.B., Wunsch, C.D.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol. 48(3), 443–453 (1970)
Padua, D.A. (ed.): Encyclopedia of Parallel Computing. Springer, New York (2011)
Palkowski, M., Klimek, T., Bielecki, W.: TRACO: an automatic loop nest parallelizer for numerical applications. In: Federated Conference on Computer Science and Information Systems, FedCSIS 2015, Lódz, Poland, 13–16 September 2015, pp. 681–686 (2015). https://doi.org/10.15439/2015F34
Pearson, W.R., Lipman, D.J.: Rapid and sensitive protein simlarity searches. Science 227, 1435–1441 (1985)
Smith, T., Waterman, M.: Identification of common molecular subsequences. J. Mol. Biol. 147(1), 195–197 (1981)
Wolfe, M.: Loops skewing: the wavefront method revisited. Int. J. Parallel Prog. 15(4), 279–293 (1986)
Xue, J.: Loop Tiling for Parallelism. The Springer International Series in Engineering and Computer Science, vol. 575. Springer, New York (2000). https://doi.org/10.1007/978-1-4615-4337-4. https://books.google.pl/books?id=DPJNwR2SBF0C
Zhao, C., Sahni, S.: Cache and energy efficient alignment of very long sequences. In: IEEE 5th International Conference on Computational Advances in Bio and Medical Sciences (ICCABS), pp. 1–6 (2015)
Zhao, C., Sahni, S.: Cache and energy efficient algorithms for Nussinov’s RNA folding. BMC Bioinform. 18(15), 518 (2017)
Acknowledgments
Thanks to the Miclab Team (miclab.pl) from the Technical University of Czestochowa (Poland) that provided access to high performance multi-core machines for the experimental study presented in this paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Pałkowski, M., Siedlecki, K., Bielecki, W. (2018). Parallel Cache Efficient Algorithm and Implementation of Needleman-Wunsch Global Sequence Alignment. In: Rutkowski, L., Scherer, R., Korytkowski, M., Pedrycz, W., Tadeusiewicz, R., Zurada, J. (eds) Artificial Intelligence and Soft Computing. ICAISC 2018. Lecture Notes in Computer Science(), vol 10842. Springer, Cham. https://doi.org/10.1007/978-3-319-91262-2_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-91262-2_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91261-5
Online ISBN: 978-3-319-91262-2
eBook Packages: Computer ScienceComputer Science (R0)