Name
Abstract | ||
|---|---|---|
Sparse matrix by vector multiplication (SMV) is a key operation of many scientific and engineering applications. Field Programmable Gate Arrays (FPGAs) have the potential to significantly improve the performance of computationally intensive applications which are dominated by SMV. A shortcoming of most existing FPGA SMV implementations is that they use on-chip Block RAM or external SRAM to store the matrix, which severely limits the problem size. Real applications, such as Finite Element Analysis (FEA), require large memories. Realistically this capacity can only be provided by commodity DRAM. In this paper we address the problem of SMV for large matrices using commodity memory. We implement SPAR, a special purpose architecture that was previously proposed for large SMV computations in a VLSI co-processor using cheap external memory. We present an empirical evaluation of the SPAR architecture for use on FPGAs and highlight challenges that arise when tackling realistic FEA problems. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/FPL.2007.4380769 | 2007 INTERNATIONAL CONFERENCE ON FIELD PROGRAMMABLE LOGIC AND APPLICATIONS, PROCEEDINGS, VOLS 1 AND 2 |
Keywords | Field | DocType |
chip,external memory,field programmable gate array,field programmable gate arrays,fea,sparse matrix,finite element analysis,vlsi,sparse matrices,fpga,matrix multiplication | Dram,Computer science,Sparse matrix-vector multiplication,Parallel computing,Static random-access memory,Multiplication,Very-large-scale integration,Matrix multiplication,Sparse matrix,Auxiliary memory | Conference |
ISSN | Citations | PageRank |
1946-1488 | 17 | 1.27 |
References | Authors | |
8 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Gregg | 1 | 441 | 51.95 |
| Colm Mcsweeney | 2 | 19 | 1.69 |
| Ciarán McElroy | 3 | 27 | 2.93 |
| Fergal Connor | 4 | 17 | 1.27 |
| Séamas McGettrick | 5 | 34 | 5.16 |
| David Moloney | 6 | 52 | 6.80 |
| Dermot Geraghty | 7 | 83 | 8.54 |