A comparison between GPU and FPGA as hardware accelerators
In the past decade, FPGAs and GPUs have become increasingly common as hardware accelerators when dealing with computationally intensive tasks. Such applications, which include digital signal processing and cryptography, often involve Single-Instruction-Multiple-Data or other highly parallelizable pr...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
2016
|
| 主題: | |
| 在線閱讀: | http://hdl.handle.net/10356/66497 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |
| 總結: | In the past decade, FPGAs and GPUs have become increasingly common as hardware accelerators when dealing with computationally intensive tasks. Such applications, which include digital signal processing and cryptography, often involve Single-Instruction-Multiple-Data or other highly parallelizable processes which CPUs, with their small number of cores, are ill-suited for; hence the need for coprocessors.
In this report, the performance of these two platforms are compared in three different applications with the goal of finding which types of application each platform is most suited for. In contrast to previous works which focus on high end or supercomputing units, an analysis is performed on a low end FPGA and a consumer GPU. This is done via benchmarking their performance against a CPU in Square Matrix Multiplication, Fast Fourier Transform and Finite Impulse Response filtering.
I show that for the three benchmark applications, when dealing with large data sets, the GPU outperforms the FPGA, while for small data sets, the FPGA is able to outperform the GPU. I also show that in several cases, the low end FPGA is unable to outperform the CPU for any data size. |
|---|