Papers
arxiv:2007.13055

Optimizing Block-Sparse Matrix Multiplications on CUDA with TVM

Published on Jul 26, 2020
Authors:

Abstract

A CUDA implementation of dense and block-sparse matrix multiplication is optimized using TVM's schedule exploration and automatic parameter tuning, achieving competitive performance with state-of-the-art frameworks.

We implemented and optimized matrix multiplications between dense and block-sparse matrices on CUDA. We leveraged TVM, a deep learning compiler, to explore the schedule space of the operation and generate efficient CUDA code. With the automatic parameter tuning in TVM, our cross-thread reduction based implementation achieved competitive or better performance compared with other state-of-the-art frameworks.

Community

Sign up or log in to comment

Get this paper in your agent:

hf papers read 2007.13055
Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash

Models citing this paper 0

No model linking this paper

Cite arxiv.org/abs/2007.13055 in a model README.md to link it from this page.

Datasets citing this paper 0

No dataset linking this paper

Cite arxiv.org/abs/2007.13055 in a dataset README.md to link it from this page.

Spaces citing this paper 0

No Space linking this paper

Cite arxiv.org/abs/2007.13055 in a Space README.md to link it from this page.

Collections including this paper 0

No Collection including this paper

Add this paper to a collection to link it from this page.