Enhanced GPU accelerated K-means algorithm for gene clustering based on a merging thread strategy

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Past research has demonstrated that gene clustering can be effectively accomplished with the K-means algorithm. Furthermore, the clustering process can be conducted swiftly with the use of graphic processing units (GPUs). However, due to the limited number of processing units (cores) on a GPU, the computation time will be lengthened if the number of gene data is too large. To alleviate this problem, a novel method for realizing the K-means algorithm on GPUs has been developed and presented in this paper. Essentially, a fragment shader program is implemented to process multiple data points in a single thread. Experimental results show that our proposed GPU accelerated scheme can attain over 25% increase in the computation speed as compared with the existing method. © Springer-Verlag 2013.

Cite

CITATION STYLE

APA

Lam, Y. K., Tsang, P. W. M., & Leung, C. S. (2013). Enhanced GPU accelerated K-means algorithm for gene clustering based on a merging thread strategy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8227 LNCS, pp. 713–720). https://doi.org/10.1007/978-3-642-42042-9_88

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free