FT K-means: A High-Performance K-means on GPU with Fault Tolerance
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914905190301696 |
|---|---|
| author | Wu, Shixun Ding, Yitong Zhai, Yujia Liu, Jinyang Huang, Jiajun Jian, Zizhe Dai, Huangliang Di, Sheng Wong, Bryan M. Chen, Zizhong Cappello, Franck |
| author_facet | Wu, Shixun Ding, Yitong Zhai, Yujia Liu, Jinyang Huang, Jiajun Jian, Zizhe Dai, Huangliang Di, Sheng Wong, Bryan M. Chen, Zizhong Cappello, Franck |
| contents | K-means is a widely used algorithm in clustering, however, its efficiency is primarily constrained by the computational cost of distance computing. Existing implementations suffer from suboptimal utilization of computational units and lack resilience against soft errors. To address these challenges, we introduce FT K-means, a high-performance GPU-accelerated implementation of K-means with online fault tolerance. We first present a stepwise optimization strategy that achieves competitive performance compared to NVIDIA's cuML library. We further improve FT K-means with a template-based code generation framework that supports different data types and adapts to different input shapes. A novel warp-level tensor-core error correction scheme is proposed to address the failure of existing fault tolerance methods due to memory asynchronization during copy operations. Our experimental evaluations on NVIDIA T4 GPU and A100 GPU demonstrate that FT K-means without fault tolerance outperforms cuML's K-means implementation, showing a performance increase of 10\%-300\% in scenarios involving irregular data shapes. Moreover, the fault tolerance feature of FT K-means introduces only an overhead of 11\%, maintaining robust performance even with tens of errors injected per second. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_01391 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | FT K-means: A High-Performance K-means on GPU with Fault Tolerance Wu, Shixun Ding, Yitong Zhai, Yujia Liu, Jinyang Huang, Jiajun Jian, Zizhe Dai, Huangliang Di, Sheng Wong, Bryan M. Chen, Zizhong Cappello, Franck Distributed, Parallel, and Cluster Computing Machine Learning K-means is a widely used algorithm in clustering, however, its efficiency is primarily constrained by the computational cost of distance computing. Existing implementations suffer from suboptimal utilization of computational units and lack resilience against soft errors. To address these challenges, we introduce FT K-means, a high-performance GPU-accelerated implementation of K-means with online fault tolerance. We first present a stepwise optimization strategy that achieves competitive performance compared to NVIDIA's cuML library. We further improve FT K-means with a template-based code generation framework that supports different data types and adapts to different input shapes. A novel warp-level tensor-core error correction scheme is proposed to address the failure of existing fault tolerance methods due to memory asynchronization during copy operations. Our experimental evaluations on NVIDIA T4 GPU and A100 GPU demonstrate that FT K-means without fault tolerance outperforms cuML's K-means implementation, showing a performance increase of 10\%-300\% in scenarios involving irregular data shapes. Moreover, the fault tolerance feature of FT K-means introduces only an overhead of 11\%, maintaining robust performance even with tens of errors injected per second. |
| title | FT K-means: A High-Performance K-means on GPU with Fault Tolerance |
| topic | Distributed, Parallel, and Cluster Computing Machine Learning |
| url | https://arxiv.org/abs/2408.01391 |