Sparse Matrix-Vector Multiplication on a Reconfigurable Supercomputer
David H. DuBois, Andrew J. DuBois, Carolyn Connor, Steve W. Poole · 2008
Double precision floating point Sparse Matrix-Vector Multiplication (SMVM) is a critical computational kernel used in iterative solvers for systems of sparse linear equations. The poor data locality exhibited by sparse matrices along with the high memory bandwidth requirements of SMVM result in poor performance on general purpose processors. Field Programmable Gate Arrays (FPGAs) offer a possible alternative with their customizable and application-targeted memory sub-system and processing elements.