About: A New Diagonal Blocking Format and Model of Cache Behavior for Sparse Matrices     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
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 suffers from 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. We have also developed a probabilistic model for estimating the numbers of cache misses during the spMV in the CARB format. Using HW cache monitoring tools, we compare the predicted numbers of cache misses with real numbers on Intel x86 architecture with L1 and L2 caches. The average accuracy of our analytical model is around 95% in case of L2 cache and 88% in case of L1 cache.
  • 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 suffers from 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. We have also developed a probabilistic model for estimating the numbers of cache misses during the spMV in the CARB format. Using HW cache monitoring tools, we compare the predicted numbers of cache misses with real numbers on Intel x86 architecture with L1 and L2 caches. The average accuracy of our analytical model is around 95% in case of L2 cache and 88% in case of L1 cache. (en)
  • Násobení řídké matice vektorem je velice častou úlohou v lineární řešičích. Kvůli nepřímému adresování je však výkonnost násobení v klasických formátech nízká. Proto byl zavedeny formáty pro diagonálního uložení řídkých matic. Tato zpráva popisuje nový formát diagonálního uložení řídkých matic, který rozšiřuje možnosti předcházejících formátů. (cs)
Title
  • A New Diagonal Blocking Format and Model of Cache Behavior for Sparse Matrices
  • Nový formát diagonálního uložení řídkých matic (cs)
  • A New Diagonal Blocking Format and Model of Cache Behavior for Sparse Matrices (en)
skos:prefLabel
  • A New Diagonal Blocking Format and Model of Cache Behavior for Sparse Matrices
  • Nový formát diagonálního uložení řídkých matic (cs)
  • A New Diagonal Blocking Format and Model of Cache Behavior for Sparse Matrices (en)
skos:notation
  • RIV/68407700:21230/06:03118854!RIV07-MSM-21230___
http://linked.open.../vavai/riv/strany
  • 164 ; 171
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(IBS3086102), Z(MSM6840770014)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 463638
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/06:03118854
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • analytical cache model; cache locality; diagonal register blocking; sparse matrix-vector multiplication (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [4C400A7F37E3]
http://linked.open...v/mistoKonaniAkce
  • Poznan
http://linked.open...i/riv/mistoVydani
  • Berlin
http://linked.open...i/riv/nazevZdroje
  • Parallel Processing and Applied Mathematics
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Šimeček, Ivan
  • Tvrdík, Pavel
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag
https://schema.org/isbn
  • 3-540-34141-2
http://localhost/t...ganizacniJednotka
  • 21230
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software