Pith. sign in

REVIEW

Efficient Interleaved Batch Matrix Solvers for CUDA

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 1909.04539 v2 pith:LINCZJR6 submitted 2019-09-10 cs.DC physics.comp-ph

Andrew Gloster , Enda Carroll , Miguel Bustamante , Lennon O'Naraigh This is my paper · ORCID
classification cs.DCphysics.comp-ph
keywords matrixefficientthereaccessesalgorithmsallowingauthorsbatch
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In this paper we present a new methodology for data accesses when solving batches of Tridiagonal and Pentadiagonal matrices that all share the same LHS matrix. By only storing one copy of this matrix there is a significant reduction in storage overheads and the authors show that there is also a performance increase in terms of compute time. These two results combined lead to an overall more efficient implementation over the current state of the art algorithms cuThomasBatch and cuPentBatch, allowing for a greater number of systems to be solved on a single GPU.

Discussion (0). Continue with ORCID to comment.

Pith tools