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”

Improving matrix-based dynamic programming on massively parallel accelerators

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F16%3A10326736" target="_blank" >RIV/00216208:11320/16:10326736 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1016/j.is.2016.06.001" target="_blank" >http://dx.doi.org/10.1016/j.is.2016.06.001</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.is.2016.06.001" target="_blank" >10.1016/j.is.2016.06.001</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Improving matrix-based dynamic programming on massively parallel accelerators

  • Original language description

    Dynamic programming techniques are well-established and employed by various practical algorithms, including the edit-distance algorithm or the dynamic time warping algorithm. These algorithms usually operate in an iteration-based manner where new values are computed from values of the previous iteration. The data dependencies enforce synchronization which limits possibilities for internal parallel processing. In this paper, we investigate parallel approaches to processing matrix-based dynamic programming algorithms on modern multicore CPUs, Intel Xeon Phi accelerators, and general purpose GPUs. We address both the problem of computing a single distance on large inputs and the problem of computing a number of distances of smaller inputs simultaneously (e.g., when a similarity query is being resolved). Our proposed solutions yielded significant improvements in performance and achieved speedup of two orders of magnitude when compared to the serial baseline.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GP14-14292P" target="_blank" >GP14-14292P: Employing Modern Parallel Architectures in Specific Domains of Database Systems</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2016

  • 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

  • Name of the periodical

    Information Systems

  • ISSN

    0306-4379

  • e-ISSN

  • Volume of the periodical

    64

  • Issue of the periodical within the volume

    March 2017

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    19

  • Pages from-to

    175-193

  • UT code for WoS article

    000391900000014

  • EID of the result in the Scopus database

    2-s2.0-85003548394