In-memory data compression for sparse matrices
Open Access
- 17 November 2013
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Abstract
We present a high performance in-memory lossless data compression scheme designed to save both memory storage and bandwidth for general sparse matrices. Because the storage hierarchy is increasingly becoming the limiting factor in overall delivered machine performance, this type of data structure compression will become increasingly important. Compared to conventional compressed sparse row (CSR) using 32-bit column indices, compressed column indices (CCI) can be over 90% smaller, yet still be decompressed at tens of gigabytes per second. We present time and space savings for 20 standard sparse matrices, on multicore CPUs and modern GPUs.Keywords
This publication has 7 references indexed in Scilit:
- The university of Florida sparse matrix collectionACM Transactions on Mathematical Software, 2011
- GPUs and the Future of Parallel ComputingIEEE Micro, 2011
- ParFUM: a parallel framework for unstructured meshes for scalable dynamic physics applicationsEngineering with Computers, 2006
- Accelerating sparse matrix computations via data compression2006
- Efficient steady-state analysis based on matrix-free Krylov-subspace methods1995
- Matrix-Free Methods for Stiff Systems of ODE’sSIAM Journal on Numerical Analysis, 1986
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952