Analysis of Memory Footprints of Sparse Matrices Partitioned Into Uniformly-Sized Blocks

##plugins.themes.bootstrap3.article.main##

Daniel Langr
Ivan Šimeček

Abstract

The presented study analyses memory footprints of 563 representative benchmark sparse matrices with respect to their partitioning into uniformly-sized blocks. Different block sizes and different ways of storing blocks in memory are considered and statistically evaluated. Memory footprints of partitioned matrices are then compared with their lower bounds and CSR, index-compressed CSR, and EBF storage formats. The results show that blocking-based storage formats may significantly reduce memory footprints of sparse matrices arising from a wide range of application domains. Additionally, measured consistency of results is presented and discussed, benefits of individual formats for storing blocks are evaluated, and an analysis of best-case and worst-case matrices is provided for in-depth understanding of causes of memory savings of blocking-based formats.

##plugins.themes.bootstrap3.article.details##

Section
Special Issue