A High Throughput FPGA-Based Floating Point Conjugate Gradient Implementation Export

@incollection{citeulike:4415417, abstract = {As Field Programmable Gate Arrays (FPGAs) have reached capacities beyond millions of equivalent gates, it becomes possible to accelerate floating-point scientific computing applications. One type of calculation that is commonplace in scientific computation is the solution of systems of linear equations. A method that has proven in software to be very efficient and robust for finding such solutions is the Conjugate Gradient algorithm. In this paper we present a parallel hardware Conjugate Gradient implementation. The implementation is particularly suited for accelerating multiple small to medium sized dense systems of linear equations. Through parallelization it is possible to convert the computation time per iteration for an order n matrix from Θ(n 2) cycles for a software implementation to Θ(n). I/O requirements are scalable and converge to a constant value with the increase of matrix order. Results on a VirtexII-6000 demonstrate sustained performance of 5 GFLOPS and projected results on a Virtex5-330 indicate sustained performance of 35 GFLOPS. The former result is comparable to high-end CPUs, whereas the latter represents a significant speedup.}, author = {Lopes, Antonio and Constantinides, George}, citeulike-article-id = {4415417}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-540-78610-8_10}, citeulike-linkout-1 = {http://www.springerlink.com/content/p125610u33408752}, doi = {10.1007/978-3-540-78610-8_10}, journal = {Reconfigurable Computing: Architectures, Tools and Applications}, keywords = {floating\_point, fpgasupercomputing, linear\_algebra, matrix, reconfigurable\_computing}, pages = {75--86}, posted-at = {2009-04-28 15:43:38}, priority = {2}, title = {A High Throughput FPGA-Based Floating Point Conjugate Gradient Implementation}, url = {http://dx.doi.org/10.1007/978-3-540-78610-8_10}, year = {2008} }

TY - CHAP ID - citeulike:4415417 L3 - citeulike-article-id:4415417 N2 - As Field Programmable Gate Arrays (FPGAs) have reached capacities beyond millions of equivalent gates, it becomes possible to accelerate floating-point scientific computing applications. One type of calculation that is commonplace in scientific computation is the solution of systems of linear equations. A method that has proven in software to be very efficient and robust for finding such solutions is the Conjugate Gradient algorithm. In this paper we present a parallel hardware Conjugate Gradient implementation. The implementation is particularly suited for accelerating multiple small to medium sized dense systems of linear equations. Through parallelization it is possible to convert the computation time per iteration for an order n matrix from Θ(n 2) cycles for a software implementation to Θ(n). I/O requirements are scalable and converge to a constant value with the increase of matrix order. Results on a VirtexII-6000 demonstrate sustained performance of 5 GFLOPS and projected results on a Virtex5-330 indicate sustained performance of 35 GFLOPS. The former result is comparable to high-end CPUs, whereas the latter represents a significant speedup. JF - Reconfigurable Computing: Architectures, Tools and Applications EP - 86 TI - A High Throughput FPGA-Based Floating Point Conjugate Gradient Implementation SP - 75 KW - floating_point KW - fpgasupercomputing KW - linear_algebra KW - matrix KW - reconfigurable_computing AU - Lopes, Antonio AU - Constantinides, George PY - 2008/// UR - http://dx.doi.org/10.1007/978-3-540-78610-8_10 ER -