Name
Abstract | ||
|---|---|---|
The K-means algorithm is a method used for the unsupervised learning task of data clustering. This work presents a K-means specific domain code generator capable of generating code for GPUs and FPGAs. To increase efficiency, the code is parameterized and specialized for Nvidia GPUs and Intel/Altera CPU-FPGA HARP v.2 platform. Furthermore, the generator is modular and can be extended to other FPGA and GPU platforms. Another contribution of this work is to simplify the use of high performance FPGAs for programmers, once our generator does not require hardware knowledge in order to provide a high performance accelerator at the software level. The generator also simplifies GPU programming. In comparison to an Intel XEON CPU, our experiments show a 55x speed-up for the GPU execution time and a 13.8x speed up for the FPGA. With regard to energy, the FPGA was up to 10 times more efficient than the evaluated GPUs (Nvidia K40 and 1080ti). |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/WSCAD.2018.00019 | 2018 Symposium on High Performance Computing Systems (WSCAD) |
Keywords | Field | DocType |
FPGA,GPU,Accelerators,K-Means | Computer science,Parallel computing,Field-programmable gate array,Code generation,Software,General-purpose computing on graphics processing units,Modular design,Xeon,Cluster analysis,Speedup | Conference |
ISBN | Citations | PageRank |
978-1-7281-3773-5 | 0 | 0.34 |
References | Authors | |
0 | 8 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jeronimo Costa Penha | 1 | 0 | 0.34 |
| Lucas Bragança | 2 | 0 | 0.34 |
| Kristtopher Coelho | 3 | 0 | 0.68 |
| Michael Canesche | 4 | 1 | 2.71 |
| Jansen Silva | 5 | 0 | 0.34 |
| Giovanni Comarela | 6 | 136 | 7.72 |
| José Augusto Miranda Nacif | 7 | 29 | 8.44 |
| Ricardo Ferreira | 8 | 49 | 13.81 |