Now showing items 1-3 of 3
Cartesian partitioning models for 2D and 3D parallel SpGEMM algorithms
The focus is distributed-memory parallelization of sparse-general-matrix-multiplication (SpGEMM). Parallel SpGEMM algorithms are classified under one-dimensional (1D), 2D, and 3D categories denoting the number of dimensions ...
Reduce operations: send volume balancing while minimizing latency
Communication hypergraph model was proposed in a two-phase setting for encapsulating multiple communication cost metrics (bandwidth and latency), which are proven to be important in parallelizing irregular applications. ...
Reordering sparse matrices into block-diagonal column-overlapped form
Many scientific and engineering applications necessitate computing the minimum norm solution of a sparse underdetermined linear system of equations. The minimum 2-norm solution of such systems can be obtained by a recent ...