Optimizing Block-Sparse Matrix Multiplications on CUDA with TVM
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.
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
Datasets citing this paper 0
No dataset linking this paper
Spaces citing this paper 0
No Space linking this paper
Collections including this paper 0
No Collection including this paper