Abstract
Motivation: Bioinformatics researchers have a variety of programming languages and architectures at their disposal, and recent advances in graphics processing unit (GPU) computing have added a promising new option. However, many performance comparisons inflate the actual advantages of GPU technology. In this study, we carry out a realistic performance evaluation of SNPrank, a network centrality algorithm that ranks single nucleotide polymorhisms (SNPs) based on their importance in the context of a phenotype-specific interaction network. Our goal is to identify the best computational engine for the SNPrank web application and to provide a variety of well-tested implementations of SNPrank for Bioinformaticists to integrate into their research. Results: Using SNP data from the Wellcome Trust Case Control Consortium genome-wide association study of Bipolar Disorder, we compare multiple SNPrank implementations, including Python, Matlab and Java as well as CPU versus GPU implementations. When compared with naïve, single-threaded CPU implementations, the GPU yields a large improvement in the execution time. However, with comparable effort, multi-threaded CPU implementations negate the apparent advantage of GPU implementations. © The Author 2010. Published by Oxford University Press. All rights reserved.
Cite
CITATION STYLE
Davis, N. A., Pandey, A., & McKinney, B. A. (2011). Real-world comparison of CPU and GPU implementations of SNPrank: A network analysis tool for GWAS. Bioinformatics, 27(2), 284–285. https://doi.org/10.1093/bioinformatics/btq638
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.