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”

Register Efficient Dynamic Memory Allocator for GPUs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00233084" target="_blank" >RIV/68407700:21230/15:00233084 - isvavai.cz</a>

  • Alternative codes found

    RIV/00216224:14330/15:00084352

  • Result on the web

    <a href="http://onlinelibrary.wiley.com/doi/10.1111/cgf.12666/abstract" target="_blank" >http://onlinelibrary.wiley.com/doi/10.1111/cgf.12666/abstract</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1111/cgf.12666" target="_blank" >10.1111/cgf.12666</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Register Efficient Dynamic Memory Allocator for GPUs

  • Original language description

    We compare five existing dynamic memory allocators optimized for GPUs and show their strengths and weaknesses. In the measurements, we use three generic evaluation tests proposed in the past and we add one with a real workload, where dynamic memory allocation is used in building the k-d tree data structure. Following the performance analysis we propose a new dynamic memory allocator and its variants that address the limitations of the existing dynamic memory allocators. The new dynamic memory allocatoruses few resources and is targeted towards large and variably sized memory allocations on massively parallel hardware architectures.

  • 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/GAP202%2F12%2F2413" target="_blank" >GAP202/12/2413: Optimal Algorithms for Image Synthesis</a><br>

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2015

  • 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

    COMPUTER GRAPHICS FORUM

  • ISSN

    0167-7055

  • e-ISSN

  • Volume of the periodical

    34

  • Issue of the periodical within the volume

    8

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    12

  • Pages from-to

    143-154

  • UT code for WoS article

    000368341800011

  • EID of the result in the Scopus database

    2-s2.0-84955172715