CB-SpMV is a cache-friendly 2D block-based SpMV algorithm for GPUs that uses data aggregation via virtual pointers, sub-block format selection, and inter-block load balancing to deliver up to 3.95x average speedup over cuSPARSE-BSR, TileSpMV, and DASP on 2843 SuiteSparse matrices.
Greathouse and Mayank Daga
2 Pith papers cite this work, alongside 241 external citations. Polarity classification is still indexing.
2
Pith papers citing it
241
external citations · OpenAlex
verdicts
UNVERDICTED 2representative citing papers
Exploiting repeated block structures converts SpMV to SpMM in CFD operators while an inline coarse-to-fine mesh strategy reduces time to statistically steady state, producing speed-ups up to over 50 percent on tested cases.
citing papers explorer
-
CB-SpMV:A Data Aggregating and Balance Algorithm for Cache-Friendly Block-Based SpMV on GPUs
CB-SpMV is a cache-friendly 2D block-based SpMV algorithm for GPUs that uses data aggregation via virtual pointers, sub-block format selection, and inter-block load balancing to deliver up to 3.95x average speedup over cuSPARSE-BSR, TileSpMV, and DASP on 2843 SuiteSparse matrices.
-
Exploiting repeated matrix block structures for more efficient CFD on modern supercomputers
Exploiting repeated block structures converts SpMV to SpMM in CFD operators while an inline coarse-to-fine mesh strategy reduces time to statistically steady state, producing speed-ups up to over 50 percent on tested cases.