Matrix multiplication

Quantum mechanics

Line graph

Algorithm

Gaussian

Linguistics

Philosophy

Locality

Accumulator (cryptography)

Parallelism (grammar)

Theoretical computer science

Sparse matrix

Parallel computing

Computer science

Physics

Graph

Dense graph

Quantum

1-planar graph

Sparse general matrix-matrix multiplication (SpGEMM) is one of the most fundamental building blocks in sparse linear solvers, graph processing frameworks and machine learning applications. The existing parallel approaches for shared memory SpGEMM mostly use the row-row style with possibly good parallelism. However, because of the irregularity in sparsity structures, the existing row-row methods often suffer from three problems: (1) load imbalance, (2) high global space complexity and unsatisfactory data locality, and (3) sparse accumulator selection.

TileSpGEMM