Storing sparse matrices to files in the adaptive-blocking hierarchical storage format

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F13%3A00211387" target="_blank" >RIV/68407700:21240/13:00211387 - isvavai.cz</a>
Result on the web
<a href="http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6644043" target="_blank" >http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6644043</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Storing sparse matrices to files in the adaptive-blocking hierarchical storage format
Original language description
When there is a need to store a sparse matrix into a file system, is it worth to convert it first into some space-efficient storage format? This paper tries to answer such question for the adaptive-blocking hierarchical storage format (ABHSF), provided that the matrix is present in memory either in the coordinate (COO) or in the compressed sparse row (CSR) storage format. The conversion algorithms from COO and CSR to ABHSF are introduced and the results of performed experiments are then presented and discussed.
Czech name
—
Czech description
—

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
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Article name in the collection
Proceedings of the 2013 Federated Conference on Computer Science and Information Systems
ISBN
978-1-4673-4471-5
ISSN
2325-0348
e-ISSN
—
Number of pages
8
Pages from-to
479-486
Publisher name
IEEE Computer Society
Place of publication
Los Alamitos
Event location
Krakow
Event date
Sep 8, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000347171500075

Similar results(10)