1178

Performance Comparison of Graphics Processors to Reconfigurable Logic: A Case Study

Ben Cope, Peter Y. K. Cheung, Wayne Luk, Lee Howes
Department of Electrical and Electronic Engineering, Imperial College London, London SW7 2BT, UK
IEEE Transactions on Computers, Vol. 59, No. 4. (April 2010), pp. 433-448.

@article{cope2010performance,

   title={Performance comparison of graphics processors to reconfigurable logic: A case study},

   author={Cope, B. and Cheung, P.Y.K. and Luk, W. and Howes, L.},

   journal={Computers, IEEE Transactions on},

   volume={59},

   number={4},

   pages={433–448},

   issn={0018-9340},

   year={2010},

   publisher={IEEE}

}

Download Download (PDF)   View View   Source Source   

559

views

A systematic approach to the comparison of the graphics processor (GPU) and reconfigurable logic is defined in terms of three throughput drivers. The approach is applied to five case study algorithms, characterized by their arithmetic complexity, memory access requirements, and data dependence, and two target devices: the nVidia GeForce 7900 GTX GPU and a Xilinx Virtex-4 field programmable gate array (FPGA). Two orders of magnitude speedup, over a general-purpose processor, is observed for each device for arithmetic intensive algorithms. An FPGA is superior, over a GPU, for algorithms requiring large numbers of regular memory accesses, while the GPU is superior for algorithms with variable data reuse. In the presence of data dependence, the implementation of a customized data path in an FPGA exceeds GPU performance by up to eight times. The trends of the analysis to newer and future technologies are analyzed.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: