Adaptive-Blocking Hierarchical Storage Format for Sparse Matrices

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F12%3A00194706" target="_blank" >RIV/68407700:21240/12:00194706 - isvavai.cz</a>
Result on the web
<a href="http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6354485" target="_blank" >http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6354485</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Adaptive-Blocking Hierarchical Storage Format for Sparse Matrices
Original language description
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.
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
S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2012
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
Federated Conference on Computer Science and Information Systems (FedCSIS 2012)
ISBN
978-1-4673-0708-6
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
545-551
Publisher name
IEEE
Place of publication
New York
Event location
Wroclaw
Event date
Sep 9, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000312714400074

Similar results(10)