Optimizing Out-Of-Memory Sparse-Dense Matrix Multiplication
We will examine state-of-the-art approaches for sparse-dense matrix multiplication (SpMDM), with a focused application on graph machine learning workloads, such as graph neural networks (GNNs), though this work is general enough such that it should apply to any application tailored for running matri...
Main Author: | Yue, Brandon |
---|---|
Other Authors: | Arvind |
Format: | Thesis |
Published: |
Massachusetts Institute of Technology
2023
|
Online Access: | https://hdl.handle.net/1721.1/151318 |
Similar Items
-
Reading the Book of Memory: Sparse Sampling versus Dense Mapping of Connectomes
by: Seung, H. Sebastian
Published: (2015) -
Tardigrade: A Hardware Accelerator for Sparse Matrix Multiplication and Sparse Convolution
by: Attaluri, Nithya
Published: (2023) -
Optimized data reuse via reordering for sparse matrix-vector multiplication on FPGAs
by: Li, Shiqing, et al.
Published: (2022) -
Information Retrieval with Dense and Sparse Representations
by: Chuang, Yung-Sung
Published: (2024) -
SpArch: Efficient Architecture for Sparse Matrix Multiplication
by: Zhang, Zhekai, et al.
Published: (2021)