Efficient Converting of Large Sparse Matrices to Quadtree Format
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F15%3A00225944" target="_blank" >RIV/68407700:21240/15:00225944 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1109/SYNASC.2014.25" target="_blank" >http://dx.doi.org/10.1109/SYNASC.2014.25</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/SYNASC.2014.25" target="_blank" >10.1109/SYNASC.2014.25</a>
Alternative languages
Result language
angličtina
Original language name
Efficient Converting of Large Sparse Matrices to Quadtree Format
Original language description
Computations with sparse matrices are widespread in scientific projects. Used data format affects strongly the performance and also the space-efficiency. Commonly used storage formats (such as COO or CSR) are not suitable neither for some numerical algebra operations (e.g., The sparse matrix-vector multiplication) due to the required indirect addressing nor for I/O file operations with sparse matrices due to their high space complexities. In our previous papers, we prove that the idea of using the quadtree for these purposes is viable. In this paper, we present a completely new algorithm based on bottom-up approach for the converting matrices from common storage formats to the quad tree format. We derive the asymptotic complexity of our new algorithm,design the parallel variant of the classical and the new algorithm, and discuss their performance.
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
2015
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
16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
ISBN
978-1-4799-8448-0
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
122-129
Publisher name
IEEE Computer Society
Place of publication
Los Alamitos
Event location
Timisoara
Event date
Sep 22, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000366596600018