The author proposes an innovative approach to iterated sparse matrix dense matrix multiplication, addressing memory limitations and communication bottlenecks by decomposing the sparse matrix into arrow matrices. This method significantly reduces communication costs and outperforms existing techniques.
Proposing an innovative arrow matrix decomposition approach to enhance communication efficiency in sparse matrix multiplication.
Efficiently decomposing sparse matrices into arrow matrices reduces communication costs and improves scalability.