About OpenMP and some combinatorial algorithms

Authors

Keywords:

parallel programming, OpenMP, accelerators

Abstract

In the current work, we present Open Multi-Processing programming interface (Open MP) and its capabilities for programming parallel algorithms using CPU. We use an example to illustrate how parallelism is achieved. We examine the accomplished speed-up and present a way of using OpenMP for work with accelerators – an offload model of work.

Author Biographies

Maria Pashinska, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences

Maria Pashinska
e-mail: mariqpashinska@math.bas.bg
Institute of Mathematics and Informatics
Bulgarian Academy of Sciences
P. O. Box 323 Veliko Tarnovo, Bulgaria

Iliya Bouyukliev, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences

Iliya Bouyukliev
e-mail: iliyab@math.bas.bg
Institute of Mathematics and Informatics
Bulgarian Academy of Sciences
P. O. Box 323 Veliko Tarnovo, Bulgaria

References

A. Hayashi, J. Shirako, E. Tiotto, R. Ho, V. Sarkar. Performance evaluation of OpenMP’s target construct on GPUs. International Journal of High Performance Computing and Networking, 13, 1 (2019), 54–69.

J. Larkin. OpenMP on GPUs, First Experiences and Best Practices, GPU technology conference, 2018.

K. Thouti, S. R. Sathe. Comparison of OpenMP & OpenCL Parallel Processing Technologies. International Journal of Advanced Computer Science and Applications (IJACSA), 3, 4 (2012), 56–61.

M. Dzhumalieva-Stoeva. Algoritmi za izsledvane na kombinatorni strukturi, PhD dissertation, Sofia, 2015.

Downloads

Published

2020-04-07

How to Cite

[1]
Pashinska, M. and Bouyukliev, I. 2020. About OpenMP and some combinatorial algorithms. Mathematics and Education in Mathematics. 49, (Apr. 2020), 167–172.

Issue

Vol. 49 (2020): Mathematics and Education in Mathematics

Section

Section B: Mathematical Modelling and Informatics