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”

Space-efficient sparse matrix storage formats for massively parallel systems

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F12%3A00193783" target="_blank" >RIV/68407700:21240/12:00193783 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Space-efficient sparse matrix storage formats for massively parallel systems

  • Original language description

    In this paper, we propose and evaluate new storage formats for sparse matrices that minimize the space complexity of information about matrix structure. The motivation of our work are applications with very large sparse matrices that due to their size must be processed on massively parallel computer systems consisting of tens or hundreds of thousands of processor cores and that must be stored in a distributed file system using parallel I/O. The parallel I/O is typically the main performance bottleneck and reading or writing such matrices from/to distributed file system can take significant amount of time. We try to reduce this time by reducing the amount of data to be processed.

  • 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

    N - Vyzkumna aktivita podporovana z neverejnych zdroju

Others

  • Publication year

    2012

  • 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

    HPCC 2012: IEEE 14th International Conference on High Performance Computing and Communications

  • ISBN

    978-0-7695-4749-7

  • ISSN

  • e-ISSN

  • Number of pages

    7

  • Pages from-to

    54-60

  • Publisher name

    IEEE Computer Society

  • Place of publication

    Los Alamitos

  • Event location

    Liverpool

  • Event date

    Jun 25, 2012

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000310377500008