An FPGA-based floating-point Jacobi iterative solver

• Published in: 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05) p. 8 pp.
• Main Authors: Morris, G.R., Prasanna, V.K.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 2005
• Subjects: Computer architecture; Concurrent computing; Coprocessors; Coupling circuits; Field programmable gate arrays; Hardware; High performance computing; Iterative methods; Jacobian matrices; Parallel processing
• ISBN: 9780769525099; 0769525091
• ISSN: 1087-4089; 2375-527X
• DOI: 10.1109/ISPAN.2005.18

Within the parallel computing domain, field programmable gate arrays (FPGA) are no longer restricted to their traditional role as substitutes for application-specific integrated circuits-as hardware "hidden" from the end user. Several high performance computing vendors offer parallel re configurable computers employing user-programmable FPGAs. These exciting new architectures allow end-users to, in effect, create reconfigurable coprocessors targeting the computationally intensive parts of each problem. The increased capability of contemporary FPGAs coupled with the embarrassingly parallel nature of the Jacobi iterative method make the Jacobi method an ideal candidate for hardware acceleration. This paper introduces a parameterized design for a deeply pipelined, highly parallelized IEEE 64-bit floating-point version of the Jacobi method. A Jacobi circuit is implemented using a Xilinx Virtex-II Pro as the target FPGA device. Implementation statistics and performance estimates are presented.