MPI vs OpenMP: A case study on parallel generation of Mandelbrot set

• Autor: Soto Gómez, Ernesto
• Formato: artículo
• Fecha de Publicación: 2020
• Institución: Universidad La Salle
• Repositorio: Revistas - Universidad La Salle
• Lenguaje: inglés
• OAI Identifier: oai:ojs.revistas.ulasalle.edu.pe:article/29
• Enlace del recurso: https://revistas.ulasalle.edu.pe/innosoft/article/view/29; https://doi.org/10.48168/innosoft.s2.a29; https://purl.org/42411/s2/a29; https://n2t.net/ark:/42411/s2/a29
• Nivel de acceso: acceso abierto
• Materia: MPI; OpenMP; parallel computing; Mandelbrot set; C; comptuación paralela; conjunto Mandelbrot

Nowadays, some of the most popular tools for parallel programming are Message Passing Interface and Open Multi-Processing. It is of interest to compare these tools in solving the same kind of problems, because of the use of different approaches to inter-task communication. This work attempts to contribute to this goal by running trials in a centralized shared memory architecture in the case of problems with an entirely parallel solution. The selected case study was the parallel computation of Mandelbrot set. Trials were conducted for different iteration limits, processors amount, and C++ implementation variants. The results show better performance in the case of Open Multi-Processing.