K-Means on Commodity GPUs with CUDA
College of Computer Science and Technology, Jilin University, 130012, China
WRI World Congress on Computer Science and Information Engineering, 2009, p.651-655
@conference{hong2009k,
title={K-Means on commodity GPUs with CUDA},
author={Hong-tao, B. and Li-li, H. and Dan-tong, O. and Zhan-shan, L. and He, L.},
booktitle={Computer Science and Information Engineering, 2009 WRI World Congress on},
volume={3},
pages={651–655},
year={2009},
organization={IEEE}
}
K-means algorithm is one of the most famous unsupervised clustering algorithms. Many theoretical improvements for the performance of original algorithms have been put forward, while almost all of them are based on single instruction single data (SISD) architecture processors (GPUs), which partly ignored the inherent paralleled characteristic of the algorithms. In this paper, a novel single instruction multiple data (SIMD) architecture processors (GPUs) based k-means algorithm is proposed. In this algorithm, in order to accelerate compute-intensive portions of traditional k-means, both data objects assignment and k-centroids recalculation are offloaded to the GPU in parallel. We have implemented this GPU-based k-means on the newest generation GPU with compute unified device architecture(CUDA). The numerical experiments demonstrated that the speed of GPU-based k-means could reach as high as 40 times of the CPU-based k-means.
January 12, 2011 by hgpu
