Scalable distributed genetic algorithm for data ordering problem with inversion using mapreduce

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present in this work a scalable distributed genetic algorithm of Data Ordering Problem with Inversion using the MapReduce paradigm. This specific topic is appealing for reduction of the power dissipation in VLSI and in bioinformatics. The capacitance and the switching activity influence the power consumption on the software level. The ordering of the data sequences is an unconditional consequence of switching activity. An optimization problem related to this topic is the ordering of sequences such that the total number of transitions will be minimized – Data Ordering Problem (DOP). Adding the bus-invert paradigm, some sequences can be complemented. The resulting problem is the DOP with Inversion (DOPI). These ordering problems are NP-hard. We establish a scalable distributed genetic approach - MapReduce Parallel Genetic Algorithm (MRPGA) for DOPI, MRPGA_DOPI and draw comparisons with greedy algorithms. The proposed methods are estimated and experiments show the efficiency of MRPGA_DOPI.

Cite

CITATION STYLE

APA

Logofatu, D., & Stamate, D. (2014). Scalable distributed genetic algorithm for data ordering problem with inversion using mapreduce. IFIP Advances in Information and Communication Technology, 436, 325–334. https://doi.org/10.1007/978-3-662-44654-6_32

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