The MPI and OpenMP Implementation of Parallel Algorithm for Generating Mandelbrot Set

Article Preview

Abstract:

The paper introduce the Mandelbrot Set and the message passing interface (MPI) and shared-memory (OpenMP), analyses the characteristic of algorithm design in the MPI and OpenMP environment, describes the implementation of parallel algorithm about Mandelbrot Set in the MPI environment and the OpenMP environment, conducted a series of evaluation and performance testing during the process of running, then the difference between the two system implementations is compared.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

26-29

Citation:

Online since:

June 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Guoliang Chen. Parallel algorithms in practice[M]. Beijing: Higher Education Press, (2004).

Google Scholar

[2] Weiming Zhou. Mul-cores computing and programming design[M]. Wuhan: Huazhong University of Science and Technology Press, (2008).

Google Scholar

[3] Xiaodong Wang. the algorithm design and analysis[M]. Wuhan: Electronic Industry Press, (2008).

Google Scholar

[4] Duzhi Hui. HPC parallel programming techniques -MPI parallel programming[M]. Beijing: Tsinghua University Press, (2001).

Google Scholar

[5] Laksono Adhianto, Barbara Chapman. Performance Modeling of Communication and Computation in Hybrid MPI and OpenMP Applications[J]. Parallel and Distributed Systems, (2006).

DOI: 10.1109/icpads.2006.81

Google Scholar

[6] Branner B. The Mandelbrot set[C]/Proc. symp. appl. math. 1989, 39: 75-105.

Google Scholar

[7] Peter S. Pacheco. An Introduction to Parallel Programming[M]. Beijing. China Machine Press, (2011).

Google Scholar