Space and execution efficient formats for modern processor architectures
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F15%3A00237946" target="_blank" >RIV/68407700:21240/15:00237946 - isvavai.cz</a>
Result on the web
<a href="http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7426068" target="_blank" >http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7426068</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/SYNASC.2015.24" target="_blank" >10.1109/SYNASC.2015.24</a>
Alternative languages
Result language
angličtina
Original language name
Space and execution efficient formats for modern processor architectures
Original language description
Sparse matrix-vector multiplication (shortly SpMV) and transposed SpMV (shortly SpMTV) are the most common routines in the numerical algebra. Sparse storage formats describe a way how sparse matrices are stored in a computer memory. Since the commonly used storage formats (like COO or CSR) are not sufficient for high-performance computations, extensive research has been conducted about maximal computational efficiency of these routines. For modern CPU architectures, the main bottleneck of these routinesis the limited memory bandwidth. In this paper, we introduce a new approach for these routines for modern processor architectures using a space efficient hierarchical format, which can significantly reduce the amount of transferred data from memory foralmost all types of matrices arising from various application disciplines. This format represents a trade-off between space and execution efficiency. The performance of these routines with this format seems to be very close to the hardwar
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
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
17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
ISBN
978-1-5090-0461-4
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
98-105
Publisher name
IEEE Computer Society
Place of publication
Los Alamitos
Event location
Timisoara
Event date
Sep 21, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—