A Model for Matrix Multiplication Performance on FPGAs

Authors:
Colin Yu Lin;Hayden Kwok-Hay So;Philip H. W. Leong
Affiliations:
-;-;-
Venue:
FPL '11 Proceedings of the 2011 21st International Conference on Field Programmable Logic and Applications
Year:
2011

Citing 0
Cited 3

Performance modeling of pipelined linear algebra architectures on FPGAs

ARC'13 Proceedings of the 9th international conference on Reconfigurable Computing: architectures, tools, and applications
Modelling reconfigurable systems in event driven simulation

ACM SIGARCH Computer Architecture News - ACM SIGARCH Computer Architecture News/HEART '12
A scalable sparse matrix-vector multiplication kernel for energy-efficient sparse-blas on FPGAs

Proceedings of the 2014 ACM/SIGDA international symposium on Field-programmable gate arrays

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computations involving matrices form the kernel of a large spectrum of computationally demanding applications for which FPGAs have been utilized as accelerators. Their performance is related to their underlying architectural and system parameters such as computational resources, memory and I/O bandwidth. A simple analytic model that gives an estimate of the performance of FPGA-based sparse matrix-vector and matrix-matrix multiplication is presented, dense matrix multiplication being a special case. The efficiency of existing implementations are compared to the model and performance trends for future technologies examined.