Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/4834
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Satarić, Bogdan | en_US |
dc.contributor.author | Slavnić V. | en_US |
dc.contributor.author | Belić A. | en_US |
dc.contributor.author | Balaž, A. | en_US |
dc.contributor.author | Muruganandam P. | en_US |
dc.contributor.author | Adhikari S. | en_US |
dc.date.accessioned | 2019-09-30T08:42:23Z | - |
dc.date.available | 2019-09-30T08:42:23Z | - |
dc.date.issued | 2016-03-01 | - |
dc.identifier.issn | 104655 | en_US |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/4834 | - |
dc.description.abstract | © 2015 Elsevier B.V. We present hybrid OpenMP/MPI (Open Multi-Processing/Message Passing Interface) parallelized versions of earlier published C programs (Vudragovic et al. 2012) for calculating both stationary and non-stationary solutions of the time-dependent Gross-Pitaevskii (GP) equation in three spatial dimensions. The GP equation describes the properties of dilute Bose-Einstein condensates at ultra-cold temperatures. Hybrid versions of programs use the same algorithms as the C ones, involving real- and imaginary-time propagation based on a split-step Crank-Nicolson method, but consider only a fully-anisotropic three-dimensional GP equation, where algorithmic complexity for large grid sizes necessitates parallelization in order to reduce execution time and/or memory requirements per node. Since distributed memory approach is required to address the latter, we combine MPI programming paradigm with existing OpenMP codes, thus creating fully flexible parallelism within a combined distributed/shared memory model, suitable for different modern computer architectures. The two presented C/OpenMP/MPI programs for real- and imaginary-time propagation are optimized and accompanied by a customizable makefile. We present typical scalability results for the provided OpenMP/MPI codes and demonstrate almost linear speedup until inter-process communication time starts to dominate over calculation time per iteration. Such a scalability study is necessary for large grid sizes in order to determine optimal number of MPI nodes and OpenMP threads per node. | en |
dc.relation.ispartof | Computer Physics Communications | en |
dc.title | Hybrid OpenMP/MPI programs for solving the time-dependent Gross–Pitaevskii equation in a fully anisotropic trap | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.doi | 10.1016/j.cpc.2015.12.006 | - |
dc.identifier.scopus | 2-s2.0-84954306591 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/84954306591 | - |
dc.description.version | Unknown | en_US |
dc.relation.lastpage | 417 | en |
dc.relation.firstpage | 411 | en |
dc.relation.volume | 200 | en |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
Appears in Collections: | FTN Publikacije/Publications |
SCOPUSTM
Citations
65
checked on May 3, 2024
Page view(s)
25
Last Week
10
10
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.