,
CANA'2012
Adaptive-Blocking Hierarchical Storage Format for Sparse Matrices
Authors: Langr, Daniel and Simecek, Ivan and Tvrdik, Pavel and Dytrych, Tomas and Draayer, Jerry P.
Keywords

Sparse matrix format; space complexity.


Abstract

Hierarchical storage formats (HSFs) can significantly reduce the space complexity of sparse matrices. They vary in storage schemes that they use for blocks and for block matrices. However, the current HSFs prescribe a fixed storage scheme for all blocks, which is not always space-optimal.We show that, generally, different storage schemes are space-optimal for different blocks. We further propose a new HSF that is based on this approach and compare its space complexity with current HSFs for benchmark matrices arising from different application areas.

 



BibTex entry:
@INPROCEEDINGS{JA_CANA12,
author = {Langr, Daniel and Simecek, Ivan and Tvrdik, Pavel and Dytrych, Tomas and Draayer, Jerry P.},
title = {Adaptive-Blocking Hierarchical Storage Format for Sparse Matrices},
booktitle = {2012 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS (FEDCSIS)},
year = {2012},
pages = {545-551},
address = {345 E 47TH ST, NEW YORK, NY 10017 USA},
publisher = {IEEE},
note = {Federated Conference on Computer Science and Information Systems (FedCSIS), Wroclaw, POLAND, SEP 09-12, 2012},
author-email = {langrd@fit.cvut.cz},
book-group-author = {{IEEE}},
doc-delivery-number = {BDC97},
isbn = {978-83-60810-48-4},
unique-id = {ISI:000312714400074}
}

BACK