All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

The study of impact of matrix-processor mapping on the parallel sparse matrix-vector multiplication

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F14%3A00213823" target="_blank" >RIV/68407700:21240/14:00213823 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1109/SYNASC.2013.49" target="_blank" >http://dx.doi.org/10.1109/SYNASC.2013.49</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/SYNASC.2013.49" target="_blank" >10.1109/SYNASC.2013.49</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    The study of impact of matrix-processor mapping on the parallel sparse matrix-vector multiplication

  • Original language description

    Sparse matrix-vector multiplication (shortly spMV) is one of the most common subroutines in the numerical linear algebra. The parallelization of this task looks easy and straightforward, but it is not optimal in general case. This paper discuss some matrix-processor mappings and their impact on parallel spMV execution on massively parallel systems. We try to balance the performance and the overhead of the required transformation. We also present algorithms for redistribution. We propose four quality measures and derive lower and upper bound for different mappings. Our $spMV$ algorithms are scalable for almost all matrices arising from various technical areas.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

    321-328

  • 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