Distributed Evolutionary Algorithm Using the MapReduce Paradigm – A Case Study for Data Compaction Problem

  • Doina Logofătu
  • Manfred Gruber
  • Dumitru Dan Dumitrescu
Part of the Studies in Computational Intelligence book series (SCI, volume 362)

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.

Keywords

Data Compaction Static Test Parallel Algorithm Evolution Strategies Greedy Discrete Optimization Apache Hadoop MapReduce Statistical Tests 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Communications of the ACM 51(1), 107–113 (2008)CrossRefGoogle Scholar
  2. 2.
    De Micheli, G.: Synthesis and Optimization of Digital Circuits. McGraw-Hill, Inc., New York (1994)Google Scholar
  3. 3.
    Drechsler, R.: Evolutionary Algorithms for VLSI CAD. Kluwer Academic Publishers, Dordrecht (1998)Google Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Logofătu, D.: Static Test Compaction for VLSI Tests: An Evolutionary Approach. Advances in Electrical and Computer Engineering 8(2), 48–53 (2008)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Logofătu, D.: Algorithmen und Problem lösungen mit C++, 2nd edn., pp. 402–411. Vieweg+Teubner, Wiesbaden (2010)CrossRefGoogle Scholar
  9. 9.
    Logofătu, D., Dumitrescu, D.: Parallel Evolutionary Approach of Compaction Problem Using MapReduce. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6239, pp. 361–370. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  10. 10.
    Apache Hadoop (2009), http://hadoop.apache.org

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Doina Logofătu
    • 1
  • Manfred Gruber
    • 1
  • Dumitru Dan Dumitrescu
    • 2
  1. 1.University of Applied SciencesMunichGermany
  2. 2.Babeş-Bolyai UniversityCluj-NapocaRomania

Personalised recommendations