10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'02) Napa, California September 22-September 24 ISBN: 0-7695-1801-X
In this paper we report on our experimentation with the use of FPGA-based system to solve the irregular computation problem of evaluating y = Ax when the matrix A is sparse. The main features of our matrix-vector multiplication algorithm are (i) an organization of the operations to suit the FPGA-based system ability in processing a stream of data, and (ii) the use of distributed arithmetic technique together with an efficient scheduling heuristic to exploit the inherent parallelism in the matrix-vector multiplication problem. The performance of our algorithm has been evaluated with an implementation on the Pamette FPGA-based system.
Citation:
Hossam ElGindy, Yen-Liang Shue, "On Sparse Matrix-Vector Multiplication with FPGA-Based System," fccm, pp.273, 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'02), 2002 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||