Generating fast sparse matrix vector multiplication from a high level generic functional IR

7Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Usage of high-level intermediate representations promises the generation of fast code from a high-level description, improving the productivity of developers while achieving the performance traditionally only reached with low-level programming approaches. High-level IRs come in two flavors: 1) domain-specific IRs designed only for a specific application area; or 2) generic high-level IRs that can be used to generate high-performance code across many domains. Developing generic IRs is more challenging but offers the advantage of reusing a common compiler infrastructure across various applications. In this paper, we extend a generic high-level IR to enable efficient computation with sparse data structures. Crucially, we encode sparse representation using reusable dense building blocks already present in the high-level IR.We use a form of dependent types to model sparse matrices in CSR format by expressing the relationship between multiple dense arrays explicitly separately storing the length of rows, the column indices, and the non-zero values of the matrix. We achieve high-performance compared to sparse lowlevel library code using our extended generic high-level code generator. On an Nvidia GPU, we outperform the highly tuned Nvidia cuSparse implementation of SpMV (Sparsematrix vector multiplication) multiplication across 28 sparse matrices of varying sparsity on average by 1.7×.

References Powered by Scopus

Halide: A language and compiler for optimizing parallelism, locality, and recomputation in image processing pipelines

361Citations
N/AReaders
Get full text

A brief overview of Agda - A functional language with dependent types

169Citations
N/AReaders
Get full text

Delite: A compiler architecture for performance-oriented embedded domain-specific languages

151Citations
N/AReaders
Get full text

Cited by Powered by Scopus

ALBUS: A method for efficiently processing SpMV using SIMD and Load balancing

23Citations
N/AReaders
Get full text

A simple and efficient storage format for SIMD-accelerated SpMV

7Citations
N/AReaders
Get full text

(De/Re)-Composition of Data-Parallel Computations via Multi-Dimensional Homomorphisms

1Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Pizzuti, F., Steuwer, M., & Dubach, C. (2020). Generating fast sparse matrix vector multiplication from a high level generic functional IR. In CC 2020 - Proceedings of the 29th International Conference on Compiler Construction (pp. 85–95). Association for Computing Machinery, Inc. https://doi.org/10.1145/3377555.3377896

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 7

88%

Researcher 1

13%

Readers' Discipline

Tooltip

Computer Science 7

64%

Engineering 2

18%

Arts and Humanities 1

9%

Chemistry 1

9%

Save time finding and organizing research with Mendeley

Sign up for free