Parallel OpenMP and CUDA Implementations of the N-Body Problem

dc.contributor.authorGangavarapu, T.
dc.contributor.authorPal, H.
dc.contributor.authorPrakash, P.
dc.contributor.authorHegde, S.
dc.contributor.authorGeetha, V.
dc.date.accessioned2026-02-06T06:37:42Z
dc.date.issued2019
dc.description.abstractThe N-body problem, in the field of astrophysics, predicts the movements of the planets and their gravitational interactions. This paper aims at developing efficient and high-performance implementations of two versions of the N-body problem. Adaptive tree structures are widely used in N-body simulations. Building and storing the tree and the need for work-load balancing pose significant challenges in high-performance implementations. Our implementations use various cores in CPU and GPU via efficient work-load balancing with data and task parallelization. The contributions include OpenMP and Nvidia CUDA implementations to parallelize force computation and mass distribution, and achieve competitive performance in terms of speedup and running time which is empirically justified and graphed. This research not only aids as an alternative to complex simulations but also to other big data applications requiring work-load distribution and computationally expensive procedures. © 2019, Springer Nature Switzerland AG.
dc.identifier.citationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2019, Vol.11619 LNCS, , p. 193-208
dc.identifier.issn3029743
dc.identifier.urihttps://doi.org/10.1007/978-3-030-24289-3_16
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/31205
dc.publisherSpringer Verlag service@springer.de
dc.subjectAll-Pairs algorithm
dc.subjectBarnes-Hut algorithm
dc.subjectCUDA
dc.subjectN-body simulations
dc.subjectOpenMP
dc.subjectParallel processing
dc.subjectPerformance
dc.titleParallel OpenMP and CUDA Implementations of the N-Body Problem

Files