Optimising Memory Bandwidth Use for Matrix-Vector Multiplication in Iterative Methods

Provided by: Imperial College London
Topic: Hardware
Format: PDF
Computing the solution to a system of linear equations is a fundamental problem in scientific computing, and its acceleration has drawn wide interest in the FPGA community. One class of algorithms to solve these systems, iterative methods, has drawn particular interest, with recent literature showing large performance improvements over General Purpose Processors (GPPs). In several iterative methods, this performance gain is largely a result of parallelization of the matrix-vector multiplication, an operation that occurs in many applications and hence has also been widely studied on FPGAs.

Find By Topic