Verification of the parallelization of harmonic sum with OpenMP and CUDA

  • Eugênio A. K. Nishimiya UFSCar
  • Nataly C. da Silva UFSCar
  • Hélio C. Guardia UFSCar
DOI: https://doi.org/10.5753/eradsp.2025.9756

Abstract


This paper investigates the efficiency for parallel solutions for the sum of the n first numbers of an harmonic progression. To this end, we consider an implementation using OpenMP, which considers shared memory, and another using CUDA, which leverages GPU processing. The results are evaluated based on metrics such as speedup and efficiency, providing a clearer understanding of the time gains produced through parallelization.

References

Bianchini, C. and Pillon, M. A. (2021). 16th marathon of parallel programming: Rules for remote contest. In Proceedings of the 16th Marathon of Parallel Programming, pages 1–1, Brazil. SBAC-PAD & WSCAD.

Kaur, R., Kumar, S. and Patle, K., 2014, A Parallel Algorithm to Process Harmonic Progression Series Using OpenMP, INTERNATIONAL JOURNAL OF ENGINEERING RESEARCH & TECHNOLOGY (IJERT) Volume 03, Issue 02 (February 2014).
Published
2025-05-28
How to Cite

Select a Format
NISHIMIYA, Eugênio A. K.; SILVA, Nataly C. da; GUARDIA, Hélio C.. Verification of the parallelization of harmonic sum with OpenMP and CUDA. In: REGIONAL SCHOOL OF HIGH PERFORMANCE COMPUTING FROM SÃO PAULO (ERAD-SP), 16. , 2025, São José do Rio Preto/SP. Anais [...]. Porto Alegre: Sociedade Brasileira de Computação, 2025 . p. 58-61. DOI: https://doi.org/10.5753/eradsp.2025.9756.