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

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Parallelisation of the 3D Fast Fourier Transform Using the Hybrid OpenMP/MPI Decomposition Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. 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. (en)
Title	Parallelisation of the 3D Fast Fourier Transform Using the Hybrid OpenMP/MPI Decomposition Parallelisation of the 3D Fast Fourier Transform Using the Hybrid OpenMP/MPI Decomposition (en)
skos:prefLabel	Parallelisation of the 3D Fast Fourier Transform Using the Hybrid OpenMP/MPI Decomposition Parallelisation of the 3D Fast Fourier Transform Using the Hybrid OpenMP/MPI Decomposition (en)
skos:notation	RIV/00216305:26230/14:PU112218!RIV15-MSM-26230___
http://linked.open...avai/riv/aktivita	S
http://linked.open...avai/riv/aktivity	S
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Nikl, Vojtěch Jaroš, Jiří
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoké učení technické v Brně / Fakulta informačních technologií
http://linked.open...dnocenehoVysledku	35712
http://linked.open...ai/riv/idVysledku	RIV/00216305:26230/14:PU112218
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Fast Fourier Transform, Decompostion, Hybrid Paralellisation, OpenMP, MPI. (en)
http://linked.open.../riv/klicoveSlovo	Decompostion Hybrid Paralellisation MPI. Fast Fourier Transform OpenMP
http://linked.open...ontrolniKodProRIV	[57BE614DEDC6]
http://linked.open...v/mistoKonaniAkce	Telč
http://linked.open...i/riv/mistoVydani	Heidelberg
http://linked.open...i/riv/nazevZdroje	Mathematical and Engineering Methods in Computer Science
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...UplatneniVysledku	2014
http://linked.open...iv/tvurceVysledku	Jaroš, Jiří Nikl, Vojtěch
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2014-10-17 (xsd:date)
number of pages	12 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-319-14896-0_9
http://purl.org/ne...btex#hasPublisher	Springer International Publishing
https://schema.org/isbn	978-3-319-14895-3
http://localhost/t...ganizacniJednotka	26230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software