Space Efficient Formats for Structure of Sparse Matrices Based on Tree Structures
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F14%3A00213822" target="_blank" >RIV/68407700:21240/14:00213822 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1109/SYNASC.2013.52" target="_blank" >http://dx.doi.org/10.1109/SYNASC.2013.52</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/SYNASC.2013.52" target="_blank" >10.1109/SYNASC.2013.52</a>
Alternative languages
Result language
angličtina
Original language name
Space Efficient Formats for Structure of Sparse Matrices Based on Tree Structures
Original language description
Very large sparse matrices are often processed on massively parallel computer systems with distributed memory architectures consisting of tens or hundreds of thousands of processor cores. The problem occurs when we want or need to load/store these matrices from/to a distributed file system. This paper deals with the design of new formats for storing very large sparse matrices suitable for parallel I/O systems. 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 latter are considerably more space efficient.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
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)
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
ISBN
978-1-4799-3035-7
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
344-351
Publisher name
IEEE Computer Society
Place of publication
Los Alamitos
Event location
Temešvár
Event date
Sep 23, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—