REVIEW 2 cited by
Finch: Sparse and Structured Tensor Programming with Control Flow
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
From FORTRAN to NumPy, tensors have revolutionized how we express computation. However, tensors in these, and almost all prominent systems, can only handle dense rectilinear integer grids. Real world tensors often contain underlying structure, such as sparsity, runs of repeated values, or symmetry. Support for structured data is fragmented and incomplete. Existing frameworks limit the tensor structures and program control flow they support to better simplify the problem. In this work, we propose a new programming language, Finch, which supports both flexible control flow and diverse data structures. Finch facilitates a programming model which resolves the challenges of computing over structured tensors by combining control flow and data structures into a common representation where they can be co-optimized. Finch automatically specializes control flow to data so that performance engineers can focus on experimenting with many algorithms. Finch supports a familiar programming language of loops, statements, ifs, breaks, etc., over a wide variety of tensor structures, such as sparsity, run-length-encoding, symmetry, triangles, padding, or blocks. Finch reliably utilizes the key properties of structure, such as structural zeros, repeated values, or clustered non-zeros. We show that this leads to dramatic speedups in operations such as SpMV and SpGEMM, image processing, and graph analytics.
Forward citations
Cited by 2 Pith papers
-
Binsparse: A Specification for Cross-Platform Storage of Sparse Matrices and Tensors
Binsparse defines a portable binary format for sparse matrices and tensors that is smaller and faster than ASCII formats, with reference parsers in five languages.
-
A Novel Compiler Transformation for Fast Sparse Matrix Multiplication in GPUs
Enumerate-and-sparse-coarsen, a source-to-source GPU compiler transformation for sparse matrix-dense matrix multiplication, reports 1.4-2.3x speedups over cuBLAS and cuSPARSE on A100 for DLMC matrices, with the exact ...
Discussion (0). Continue with ORCID to comment.