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

May 22, 2019 Β· Declared Dead Β· πŸ› IEEE Symposium on Field-Programmable Custom Computing Machines

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Yuke Wang, Zhaorui Zeng, Boyuan Feng, Lei Deng, Yufei Ding arXiv ID 1905.09345 Category cs.DC: Distributed Computing Citations 5 Venue IEEE Symposium on Field-Programmable Custom Computing Machines Last Checked 4 months ago
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).
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Distributed Computing

Died the same way β€” πŸ‘» Ghosted