Table of Contents Author Guidelines Submit a Manuscript
Advances in Multimedia
Volume 2015, Article ID 575687, 9 pages
http://dx.doi.org/10.1155/2015/575687
Research Article

Performance Comparison of OpenMP, MPI, and MapReduce in Practical Problems

Department of Computer Science, Chungbuk National University, Cheongju, Chungbuk 361-763, Republic of Korea

Received 29 August 2014; Accepted 8 November 2014

Academic Editor: Seungmin Rho

Copyright © 2015 Sol Ji Kang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

With problem size and complexity increasing, several parallel and distributed programming models and frameworks have been developed to efficiently handle such problems. This paper briefly reviews the parallel computing models and describes three widely recognized parallel programming frameworks: OpenMP, MPI, and MapReduce. OpenMP is the de facto standard for parallel programming on shared memory systems. MPI is the de facto industry standard for distributed memory systems. MapReduce framework has become the de facto standard for large scale data-intensive applications. Qualitative pros and cons of each framework are known, but quantitative performance indexes help get a good picture of which framework to use for the applications. As benchmark problems to compare those frameworks, two problems are chosen: all-pairs-shortest-path problem and data join problem. This paper presents the parallel programs for the problems implemented on the three frameworks, respectively. It shows the experiment results on a cluster of computers. It also discusses which is the right tool for the jobs by analyzing the characteristics and performance of the paradigms.