Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/4342
Title: OpenMP, OpenMP/MPI, and CUDA/MPI C programs for solving the time-dependent dipolar Gross–Pitaevskii equation
Authors: Lončar V.
Young L.
Škrbić, Srđan 
Muruganandam P.
Adhikari S.
Balaž, A.
Issue Date: 1-Dec-2016
Journal: Computer Physics Communications
Abstract: © 2016 Elsevier B.V. We present new versions of the previously published C and CUDA programs for solving the dipolar Gross–Pitaevskii equation in one, two, and three spatial dimensions, which calculate stationary and non-stationary solutions by propagation in imaginary or real time. Presented programs are improved and parallelized versions of previous programs, divided into three packages according to the type of parallelization. First package contains improved and threaded version of sequential C programs using OpenMP. Second package additionally parallelizes three-dimensional variants of the OpenMP programs using MPI, allowing them to be run on distributed-memory systems. Finally, previous three-dimensional CUDA-parallelized programs are further parallelized using MPI, similarly as the OpenMP programs. We also present speedup test results obtained using new versions of programs in comparison with the previous sequential C and parallel CUDA programs. The improvements to the sequential version yield a speedup of 1.1–1.9, depending on the program. OpenMP parallelization yields further speedup of 2–12 on a 16-core workstation, while OpenMP/MPI version demonstrates a speedup of 11.5–16.5 on a computer cluster with 32 nodes used. CUDA/MPI version shows a speedup of 9–10 on a computer cluster with 32 nodes.
URI: https://open.uns.ac.rs/handle/123456789/4342
ISSN: 00104655
DOI: 10.1016/j.cpc.2016.07.029
Appears in Collections:PMF Publikacije/Publications

Show full item record

SCOPUSTM   
Citations

41
checked on Sep 9, 2023

Page view(s)

17
Last Week
7
Last month
0
checked on May 3, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.