Poster Type: ACM SRC Posters
Author: Precious Eyabi (Clemson University)
Abstract: Sparse matrix vector multiplication (SPMV) plays a critical role in scientific computing. From computational fluid dynamics, to artificial intelligence, to economics problems, the use cases are vast. Additionally, the data required for high performance computing (HPC) jobs is quickly outgrowing available memory storage. In-line compression aims to mitigate this memory bottleneck by keeping data compressed in storage and only decompressing as needed. We analyze the effects of performing this in-line compression with SPMV and apply various optimizations to examine their effects on execution time and the overall memory footprint.
Best Poster Finalist (BP): no
Poster: PDF
Poster Summary: PDF