Call for Paper - July 2019 Edition
IJCA solicits original research papers for the July 2019 Edition. Last date of manuscript submission is June 20, 2019. Read More

Optimized Convex Hull With Mixed (MPI and OpenMP) Programming On HPC

Print
PDF
International Journal of Computer Applications
© 2010 by IJCA Journal
Number 5 - Article 14
Year of Publication: 2010
Authors:
Sandip V.Kendre
Dr.D.B.Kulkarni
10.5120/118-233

Sandip V.Kendre and D.B.Kulkarni. Article: 0ptimized Convex Hull With Mixed (MPI and OpenMP) Programming On HPC. International Journal of Computer Applications 1(5):80–84, February 2010. Published By Foundation of Computer Science. BibTeX

@article{key:article,
	author = {Sandip V.Kendre and D.B.Kulkarni},
	title = {Article: 0ptimized Convex Hull With Mixed (MPI and OpenMP) Programming On HPC},
	journal = {International Journal of Computer Applications},
	year = {2010},
	volume = {1},
	number = {5},
	pages = {80--84},
	month = {February},
	note = {Published By Foundation of Computer Science}
}

Abstract

As a programmer, one is aspired to solve ever larger, more memory intensive problems, or simply solve problems with greater speed than possible on a sequential computer. A programmer can turn to parallel programming and parallel computers to satisfy these needs. Parallel programming methods on parallel computers gives access to greater memory and Central Processing Unit (CPU) resources which is not available on sequential computers. This paper discusses the benefits of developing 2D and 3D convex hull on mixed mode MPI, OpenMP applications on both single and clustered SMPs. In this experimentation for purpose of optimization of 3D convex hull we merged both MPI and OpenMP library which gives another mixed mode programming method to get optimized results. The job is divided into sub-jobs and are submitted to cluster of SMP nodes using MPI and these sub-jobs are computed in parallel using OpenMP threads in SMP nodes. Experiments on sequential, MPI, OpenMP and Hybrid programming models show that Hybrid programming model substantially outperforms others.

Reference

    [1] D.S. Henty, "Performance of hybrid message-passing and shared-memory parallelism for Discrete Element Modeling", presented at Supercomputing, Dallas,2000. http://www.sc2000.org/proceedings/techpapr/papers/pap154.pdf.
    [2] MPI: "A Message-Passing Interface standard", Message Passing Interface Forum, June1995. http://www.mpi-forum.org/
    [3] OpenMP, The OpenMP ARB. http://www.OpenMP.org/
    [4] "A performance comparison of C with MPI and OpenMP" on the Origin 2000, J. Hoeflinger, Centre for Simulation of Advanced Rockets. http://polaris.cs.uiuc.edu/_hoefling/Talks/
    [5] D.K. Tafti, "Computational power balancing", Help for the overloaded processor. http://access.ncsa.uiuc.edu/Features/ Load-Balancing/
    [6] P. Lanucara and S. Rovida, "Conjugate-Gradient algortihms: An MPI-OpenMP implementation on distributed shared memory systems", proceeding of the 1st European Workshop on OpenMP, Lund, Sweden, 1999.