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”

Parallelisation of the 3D Fast Fourier Transform Using the Hybrid OpenMP/MPI Decomposition

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F14%3APU112218" target="_blank" >RIV/00216305:26230/14:PU112218 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.fit.vut.cz/research/publication/10706/" target="_blank" >https://www.fit.vut.cz/research/publication/10706/</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-14896-0_9" target="_blank" >10.1007/978-3-319-14896-0_9</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Parallelisation of the 3D Fast Fourier Transform Using the Hybrid OpenMP/MPI Decomposition

  • Original language description

    The 3D fast Fourier transform (FFT) is the heart of many simulation methods. Although the efficient parallelisation of the FFT has been deeply studied over last few decades, many researchers only focused on either pure message passing (MPI) or shared memory (OpenMP) implementations. Unfortunately, pure MPI approaches cannot exploit the shared memory within the cluster node and the OpenMP cannot scale over multiple nodes. This paper proposes a 2D hybrid decomposition of the 3D FFT where the domain is decomposed over the first axis by means of MPI while over the second axis by means of OpenMP. The performance of the pro-posed method is thoroughly compared with the state of the art libraries (FFTW, PFFT, P3DFFT) on three supercomputer systems with up to 16k cores. The experimental results show that the hybrid implementation offers 10-20% higher performance and better scaling especially for high core counts.

  • 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

    V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

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

    Mathematical and Engineering Methods in Computer Science

  • ISBN

    978-3-319-14895-3

  • ISSN

  • e-ISSN

  • Number of pages

    13

  • Pages from-to

    100-112

  • Publisher name

    Springer International Publishing

  • Place of publication

    Heidelberg

  • Event location

    Telč

  • Event date

    Oct 17, 2014

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000357573300009