Abstract
A parallel evolutionary approach of Compaction Problem is introduced using MapReduce. This problem is of interest for VLSI testing and bioinformatics. The overall cost of a VLSI circuit’s testing depends on the length of its test sequence; therefore the reduction of this sequence, keeping the coverage, will lead to a reduction of used resources in the testing process. The problem of finding minimal test sets is NP-hard. We introduce a distributed evolutionary algorithm (MapReduce Parallel Evolutionary Algorithm−MRPEA) and compare it with two greedy approaches. The proposed algorithms are evaluated on randomly generated five-valued benchmarks that are scalable in size. The MapReduce paradigm offers the possibility to distribute and scale large amount of data. Experiments show the efficiency of the proposed parallel approach. The project, containing the Hadoop implementation can be found at: http://sourceforge.net/projects/dcpsolver/ [10].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Communications of the ACM 51(1), 107–113 (2008)
De Micheli, G.: Synthesis and Optimization of Digital Circuits. McGraw-Hill, Inc., New York (1994)
Drechsler, R.: Evolutionary Algorithms for VLSI CAD. Kluwer Academic Publishers, Dordrecht (1998)
El-Maleh, A., Osais, Y.: Test vector decomposition based static compaction algorithms for combinatorial circuits. ACM Trans. Des. Autom. Electron. Syst. (TODAES) 8, 430–459 (2003)
Logofătu, D., Drechsler, R.: Comparative Study by Solving the Test Compaction Problem. In: Proceedings of the 38th International Symposium on Multiple Valued Logic, pp. 44–49 (2008)
Logofătu, D.: Static Test Compaction for VLSI Tests: An Evolutionary Approach. Advances in Electrical and Computer Engineering 8(2), 48–53 (2008)
Logofătu, D.: DNA Sequence Vectors and Their Compaction. In: AIP Conf. Proceedings of the 1st International Conference on Bio-Inspired Computational Methods Used for Solving Difficult Problems: Development of Intelligent and Complex Systems, vol. 1117(1), pp. 29–39 (2008)
Logofătu, D.: Algorithmen und Problemlösungen mit C++, 2nd edn., pp. 402–411. Vieweg+Teubner, Wiesbaden (2010)
Apache Hadoop (2009), http://hadoop.apache.org
Open Source Project, dopiSolver (2010), http://sourceforge.net/projects/dcpsolver/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Logofătu, D., Dumitrescu, D. (2010). Parallel Evolutionary Approach of Compaction Problem Using MapReduce. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds) Parallel Problem Solving from Nature, PPSN XI. PPSN 2010. Lecture Notes in Computer Science, vol 6239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15871-1_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-15871-1_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15870-4
Online ISBN: 978-3-642-15871-1
eBook Packages: Computer ScienceComputer Science (R0)