Pith. sign in

REVIEW

Synergistic CPU-FPGA Acceleration of Sparse Linear Algebra

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2004.13907 v1 pith:CWGO2P7X submitted 2020-04-29 cs.DC cs.MScs.PL

classification cs.DCcs.MScs.PL
keywords sparsecomputationfpgamatrixreapalgebracpu-fpgaelements
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper describes REAP, a software-hardware approach that enables high performance sparse linear algebra computations on a cooperative CPU-FPGA platform. REAP carefully separates the task of organizing the matrix elements from the computation phase. It uses the CPU to provide a first-pass re-organization of the matrix elements, allowing the FPGA to focus on the computation. We introduce a new intermediate representation that allows the CPU to communicate the sparse data and the scheduling decisions to the FPGA. The computation is optimized on the FPGA for effective resource utilization with pipelining. REAP improves the performance of Sparse General Matrix Multiplication (SpGEMM) and Sparse Cholesky Factorization by 3.2X and 1.85X compared to widely used sparse libraries for them on the CPU, respectively.

Discussion (0). Continue with ORCID to comment.

Pith tools