SWAPHI: Smith-Waterman Protein Database Search on Xeon Phi Coprocessors
Institut fur Informatik, Johannes Gutenberg Universitat Mainz, Mainz, Germany
arXiv:1404.4152 [cs.DC], (17 Apr 2014)
@article{2014arXiv1404.4152L,
author={Liu}, Y. and {Schmidt}, B.},
title={"{SWAPHI: Smith-Waterman Protein Database Search on Xeon Phi Coprocessors}"},
journal={ArXiv e-prints},
archivePrefix={"arXiv"},
eprint={1404.4152},
primaryClass={"cs.DC"},
keywords={Computer Science – Distributed, Parallel, and Cluster Computing},
year={2014},
month={apr},
adsurl={http://adsabs.harvard.edu/abs/2014arXiv1404.4152L},
adsnote={Provided by the SAO/NASA Astrophysics Data System}
}
The maximal sensitivity of the Smith-Waterman (SW) algorithm has enabled its wide use in biological sequence database search. Unfortunately, the high sensitivity comes at the expense of quadratic time complexity, which makes the algorithm computationally demanding for big databases. In this paper, we present SWAPHI, the first parallelized algorithm employing Xeon Phi coprocessors to accelerate SW protein database search. SWAPHI is designed based on the scale-and-vectorize approach, i.e. it boosts alignment speed by effectively utilizing both the coarse-grained parallelism from the many co-processing cores (scale) and the fine-grained parallelism from the 512-bit wide single instruction, multiple data (SIMD) vectors within each core (vectorize). By searching against the large UniProtKB/TrEMBL protein database, SWAPHI achieves a performance of up to 58.8 billion cell updates per second (GCUPS) on one coprocessor and up to 228.4 GCUPS on four coprocessors. Furthermore, it demonstrates good parallel scalability on varying number of coprocessors, and is also superior to both SWIPE on 16 high-end CPU cores and BLAST+ on 8 cores when using four coprocessors, with the maximum speedup of 1.52 and 1.86, respectively. SWAPHI is written in C++ language (with a set of SIMD intrinsics), and is freely available at http://swaphi.sourceforge.net/
April 21, 2014 by hgpu
