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: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Published: |
Massachusetts Institute of Technology
2023
|
| Online Access: | https://hdl.handle.net/1721.1/151318 |
| _version_ | 1826191071984484352 |
|---|---|
| author | Yue, Brandon |
| author2 | Arvind |
| author_facet | Arvind Yue, Brandon |
| author_sort | Yue, Brandon |
| collection | MIT |
| description | 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 matrix multiplication workloads that cannot fit in memory. Specifically, we will conduct a thorough and in-depth analysis on the various optimization strategies, including sparse matrix formats, tiling, load balancing, and data locality, and investigate how they affect performance. Based on the performance study, we will design and implement an out-of-core framework that supports massive graph datasets which can not fit into memory. We foresee challenges in mitigating the overhead of accessing external storage, as well as finding a way to balance performance with optimization of CPU/GPU memory usage. We will compare our out-of-core solution with state-of-the-art in-memory solutions as well as distributed solutions, and analyze the algorithmic complexity and overall overhead involved in our implementation. |
| first_indexed | 2024-09-23T08:50:03Z |
| format | Thesis |
| id | mit-1721.1/151318 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T08:50:03Z |
| publishDate | 2023 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/1513182023-08-01T04:16:44Z Optimizing Out-Of-Memory Sparse-Dense Matrix Multiplication Yue, Brandon Arvind Chen, Xuhao Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 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 matrix multiplication workloads that cannot fit in memory. Specifically, we will conduct a thorough and in-depth analysis on the various optimization strategies, including sparse matrix formats, tiling, load balancing, and data locality, and investigate how they affect performance. Based on the performance study, we will design and implement an out-of-core framework that supports massive graph datasets which can not fit into memory. We foresee challenges in mitigating the overhead of accessing external storage, as well as finding a way to balance performance with optimization of CPU/GPU memory usage. We will compare our out-of-core solution with state-of-the-art in-memory solutions as well as distributed solutions, and analyze the algorithmic complexity and overall overhead involved in our implementation. M.Eng. 2023-07-31T19:30:59Z 2023-07-31T19:30:59Z 2023-06 2023-06-06T16:34:43.943Z Thesis https://hdl.handle.net/1721.1/151318 In Copyright - Educational Use Permitted Copyright retained by author(s) https://rightsstatements.org/page/InC-EDU/1.0/ application/pdf Massachusetts Institute of Technology |
| spellingShingle | Yue, Brandon Optimizing Out-Of-Memory Sparse-Dense Matrix Multiplication |
| title | Optimizing Out-Of-Memory Sparse-Dense Matrix Multiplication |
| title_full | Optimizing Out-Of-Memory Sparse-Dense Matrix Multiplication |
| title_fullStr | Optimizing Out-Of-Memory Sparse-Dense Matrix Multiplication |
| title_full_unstemmed | Optimizing Out-Of-Memory Sparse-Dense Matrix Multiplication |
| title_short | Optimizing Out-Of-Memory Sparse-Dense Matrix Multiplication |
| title_sort | optimizing out of memory sparse dense matrix multiplication |
| url | https://hdl.handle.net/1721.1/151318 |
| work_keys_str_mv | AT yuebrandon optimizingoutofmemorysparsedensematrixmultiplication |