pith. sign in

arxiv: 1905.09345 · v1 · pith:2XGUJADAnew · submitted 2019-05-22 · 💻 cs.DC

KPynq: A Work-Efficient Triangle-Inequality based K-means on FPGA

classification 💻 cs.DC
keywords k-meanskpynqfpgatriangle-inequalitywork-efficientaddressalgorithmalgorithm-level
0
0 comments X
read the original abstract

K-means is a popular but computation-intensive algorithm for unsupervised learning. To address this issue, we present KPynq, a work-efficient triangle-inequality based K-means on FPGA for handling large-size, high-dimension datasets. KPynq leverages an algorithm-level optimization to balance the performance and computation irregularity, and a hardware architecture design to fully exploit the pipeline and parallel processing capability of various FPGAs. In the experiment, KPynq consistently outperforms the CPU-based standard K-means in terms of its speedup (up to 4.2x) and significant energy-efficiency (up to 218x).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.