A New Diagonal Blocking Format and Model of Cache Behavior for Sparse Matrices
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F06%3A00114524" target="_blank" >RIV/68407700:21230/06:00114524 - isvavai.cz</a>
Result on the web
<a href="http://shimi.webzdarma.cz/vyzkum/workshop06/reg_bl_workshop.doc" target="_blank" >http://shimi.webzdarma.cz/vyzkum/workshop06/reg_bl_workshop.doc</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A New Diagonal Blocking Format and Model of Cache Behavior for Sparse Matrices
Original language description
Algorithms for the sparse matrix-vector multiplication (shortly SpMV) are important building blocks in solvers of sparse systems of linear equations. Due to matrix sparsity, the memory access patterns are irregular and the utilization of a cache suffersfrom low spatial and temporal locality. To reduce this effect, the diagonal register blocking format was designed. This paper introduces a new combined format, called CARB, for storing sparse matrices that extends possibilities of the diagonal register blocking format.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/IBS3086102" target="_blank" >IBS3086102: Parallel Algorithms for Large Scale Simulation on PC Clusters</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2006
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
Proceedings of Workshop 2006
ISBN
80-01-03439-9
ISSN
—
e-ISSN
—
Number of pages
2
Pages from-to
116-117
Publisher name
ČVUT
Place of publication
Praha
Event location
Praha
Event date
Feb 20, 2006
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—