Physics

Graph

Accumulator (cryptography)

Algorithm

1-planar graph

Dense graph

Gaussian

Philosophy

Matrix multiplication

Parallel computing

Line graph

Locality

Computer science

Linguistics

Sparse matrix

Quantum mechanics

Parallelism (grammar)

Theoretical computer science

Quantum

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