|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
2009 WRI World Congress on Computer Science and Information Engineering
K-Means on Commodity GPUs with CUDA
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
| ASCII Text | x | ||
| Bai Hong-tao, He Li-li, Ouyang Dan-tong, Li Zhan-shan, Li He, "K-Means on Commodity GPUs with CUDA," Computer Science and Information Engineering, World Congress on, vol. 3, pp. 651-655, 2009 WRI World Congress on Computer Science and Information Engineering, 2009. | |||
| BibTex | x | ||
| @article{ 10.1109/CSIE.2009.491, author = {Bai Hong-tao and He Li-li and Ouyang Dan-tong and Li Zhan-shan and Li He}, title = {K-Means on Commodity GPUs with CUDA}, journal ={Computer Science and Information Engineering, World Congress on}, volume = {3}, year = {2009}, isbn = {978-0-7695-3507-4}, pages = {651-655}, doi = {http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.491}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Computer Science and Information Engineering, World Congress on TI - K-Means on Commodity GPUs with CUDA SN - 978-0-7695-3507-4 SP651 EP655 A1 - Bai Hong-tao, A1 - He Li-li, A1 - Ouyang Dan-tong, A1 - Li Zhan-shan, A1 - Li He, PY - 2009 KW - K-means KW - GPU KW - SIMD KW - CUDA VL - 3 JA - Computer Science and Information Engineering, World Congress on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.491
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 (CPUs), 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.
Index Terms:
K-means, GPU, SIMD, CUDA
Citation:
Bai Hong-tao, He Li-li, Ouyang Dan-tong, Li Zhan-shan, Li He, "K-Means on Commodity GPUs with CUDA," csie, vol. 3, pp.651-655, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.
