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”

Astute Approach to Handling Memory Layouts of Regular Data Structures

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F22%3A10492531" target="_blank" >RIV/00216208:11320/22:10492531 - isvavai.cz</a>

  • Result on the web

    <a href="https://link.springer.com/chapter/10.1007/978-3-031-22677-9_27" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-031-22677-9_27</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-031-22677-9_27" target="_blank" >10.1007/978-3-031-22677-9_27</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Astute Approach to Handling Memory Layouts of Regular Data Structures

  • Original language description

    Programmers of high-performance applications face many challenging aspects of contemporary hardware architectures. One of the critical aspects is the efficiency of memory operations which is affected not only by the hardware parameters such as memory throughput or cache latency but also by the data-access patterns, which may influence the utilization of the hardware, such as re-usability of the cached data or coalesced data transactions. Therefore, a performance of an algorithm can be highly impacted by the layout of its data structures or the order of data processing which may translate into a more or less optimal sequence of memory operations. These effects are even more pronounced on highly-parallel platforms, such as GPUs, which often employ specific execution models (lock-step) or memory models (shared memory). In this work, we propose a modern, astute approach for managing and implementing memory layouts with first-class structures that is very efficient and straightforward. This approach was im

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2022

  • 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

    22nd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2022, Copenhagen, Denmark (Online), 10 - 12 October, 2022

  • ISBN

    978-3-031-22676-2

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    22

  • Pages from-to

    507-528

  • Publisher name

    Springer International Publishing

  • Place of publication

    Cham, Switzerland

  • Event location

    København, Denmark

  • Event date

    Oct 10, 2022

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article