Make Inference Faster: Efficient GPU Memory Management for Butterfly Sparse Matrix Multiplication - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2024

Make Inference Faster: Efficient GPU Memory Management for Butterfly Sparse Matrix Multiplication

Abstract

This paper is the first to assess the state of existing sparse matrix multiplication algorithms on GPU for the butterfly structure, a promising form of sparsity. This is achieved through a comprehensive benchmark that can be easily modified to add a new implementation. The goal is to provide a simple tool for users to select the optimal implementation based on their settings. Using this benchmark, we find that existing implementations spend up to 50% of their total runtime on memory rewriting operations. We show that these memory operations can be optimized by introducing a new CUDA kernel that minimizes the transfers between the different levels of GPU memory, achieving a median speed-up factor of x1.4 while also reducing energy consumption (median of x0.85). We also demonstrate the broader significance of our results by showing how the new kernel can speed up the inference of neural networks.
Fichier principal
Vignette du fichier
neurips_2024.pdf (896.33 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04584450 , version 1 (23-05-2024)
hal-04584450 , version 2 (23-05-2024)

Identifiers

  • HAL Id : hal-04584450 , version 2

Cite

Antoine Gonon, Léon Zheng, Pascal Carrivain, Quoc-Tung Le. Make Inference Faster: Efficient GPU Memory Management for Butterfly Sparse Matrix Multiplication. 2024. ⟨hal-04584450v2⟩
0 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More