Developing genetic algorithms using different mapreduce frameworks: MPI vs. Hadoop

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

Abstract

MapReduce is a quite popular paradigm, which allows to no specialized users to use large parallel computational platforms in a transparent way. Hadoop is the most used implementation of this paradigm, and in fact, for a large amount of users the word Hadoop and MapReduce are interchangeable. But, there are other frameworks that implement this programming paradigm, such as MapReduce-MPI. Since, optimization techniques can be greatly beneficiary of this kind of data-intensive computing modeling, in this paper, we analyze the performance effect of developing genetic algorithms (GA) using different frameworks of MapReduce (MRGA). In particular, we implement MRGA using Hadoop and MR-MPI frameworks. We analyze and compare both implementations considering relevant aspects such as efficiency and scalability to solve a large dimension problem. The results show a similar efficiency level between the algorithms but Hadoop presents a better scalability.

Cite

CITATION STYLE

APA

Salto, C., Minetti, G., Alba, E., & Luque, G. (2018). Developing genetic algorithms using different mapreduce frameworks: MPI vs. Hadoop. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11160 LNAI, pp. 262–272). Springer Verlag. https://doi.org/10.1007/978-3-030-00374-6_25

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