Tree-based Space Efficient Formats for Storing the Structure of Sparse Matrices

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F14%3A00217666" target="_blank" >RIV/68407700:21240/14:00217666 - isvavai.cz</a>

Result on the web

<a href="http://www.scpe.org/index.php/scpe/article/view/962" target="_blank" >http://www.scpe.org/index.php/scpe/article/view/962</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.12694/scpe.v15i1.962" target="_blank" >10.12694/scpe.v15i1.962</a>

Result language

angličtina

Original language name

Tree-based Space Efficient Formats for Storing the Structure of Sparse Matrices

Original language description

Sparse storage formats describe a way how sparse matrices are stored in a computer memory. Extensive research has been conducted about these formats in the context of performance optimization of the sparse matrix-vector multiplication algorithms, but memory efficient formats for storing sparse matrices are still under development, since the commonly used storage formats (like COO or CSR) are not sufficient. In this paper, we propose and evaluate new storage formats for sparse matrices that minimize thespace complexity of information about matrix structure. The first one is based on arithmetic coding and the second one is based on binary tree format. We compare the space complexity of common storage formats and our new formats and prove that the latterare considerably more space efficient.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/GAP202%2F12%2F2011" target="_blank" >GAP202/12/2011: Parallel Input/Output Algorithms for Very Large Sparse Matrices</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2014

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Scalable Computing: Practice and Experience

ISSN

1895-1767

e-ISSN

—

Volume of the periodical

15

Issue of the periodical within the volume

1

Country of publishing house

RO - ROMANIA

Number of pages

20

Pages from-to

1-20

UT code for WoS article

—

EID of the result in the Scopus database

—