A case study of OpenMP applied to map/reduce-style computations

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

As data analytics are growing in importance they are also quickly becoming one of the dominant application domains that require parallel processing. This paper investigates the applicability of OpenMP, the dominant shared-memory parallel programming model in high-performance computing, to the domain of data analytics. We contrast the performance and programmability of key data analytics benchmarks against Phoenix++, a state-of-the-art shared memory map/reduce programming system. Our study shows that OpenMP outperforms the Phoenix++ system by a large margin for several benchmarks. In other cases, however, the programming model is lacking support for this application domain.

Author supplied keywords

Cite

CITATION STYLE

APA

Arif, M., & Vandierendonck, H. (2015). A case study of OpenMP applied to map/reduce-style computations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9342, pp. 162–174). Springer Verlag. https://doi.org/10.1007/978-3-319-24595-9_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free