Skip to main content

Exploiting competing subpopulations for automatic generation of test sequences for digital circuits

  • Applications of Evolutionary Computation Evolutionary Computation in Electrical, Electronics, and Communications Engineering
  • Conference paper
  • First Online:
Parallel Problem Solving from Nature — PPSN IV (PPSN 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1141))

Included in the following conference series:

  • 147 Accesses

Abstract

The paper describes the application of a Parallel Genetic Algorithm to Automatic Test Pattern Generation (ATPG) for digital circuits. Genetic Algorithms have been already proposed to solve this industrially critical problem, both on mono- and multi-processor architectures. Although preliminary results are very encouraging, there are some obstacles which limit their use: in particular, GAs are often unable to detect some hard to test faults, and require a careful tuning of the algorithm parameters. In this paper, we describe a new parallel version of an existing GA-based ATPG, which exploits competing sub-populations to overcome these problems. The new approach has been implemented in the PVM environment and has been evaluated on a workstation network using standard benchmark circuits. Preliminary results show that it is able to improve the results quality (by testing additional critical faults) at the expense of increased CPU time requirements.

This work is partially supported by European Union through the PCI project #9452 94 204 70 (PETREL).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abramovici, M.A. Breuer, A.D. Friedman: “Digital Systems Testing and Testable Design,” Computer Science Press, 1990

    Google Scholar 

  2. V.D. Agrawal, K.-T. Cheng, P. Agrawal, “CONTEST: A Concurrent Test Generator for Sequential Circuits,” Proc. 25th Design Automation Conference, 1988, pp. 84–89

    Google Scholar 

  3. F. Brglez, D. Bryant, K. Kozminski, “Combinational profiles of sequential benchmark circuits,” Proc. Int. Symp. on Circuits And Systems, 1989, pp. 1929–1934

    Google Scholar 

  4. H. Cho, G.D. Hatchel, F. Somenzi, “Redundancy Identification/Removal and Test Generation for Sequential Circuits Using Implicit State Enumeration,” IEEE Trans. on CAD/ICAS, Vol. CAD-12, No. 7, pp. 935–945, 1993

    Google Scholar 

  5. F. Corno, P. Prinetto, M. Rebaudengo, M. Sonza Reorda, E. Veiluva, “A Portable ATPG Tool for Parallel and Distributed Systems,” Proc. IEEE VLSI Test Symposium, 1995, pp. 29–34

    Google Scholar 

  6. F. Corno, P. Prinetto, M. Rebaudengo, M. Sonza Reorda, “A Genetic Algorithm for Automatic Test Pattern Generation for Large Synchronous Sequential Circuits,” to appear on the IEEE Transactions on Computer Aided Design

    Google Scholar 

  7. F. Corno, P. Prinetto, M. Rebaudengo, M. Sonza Reorda, R. Mosca, ”Advanced Techniques for GA-based sequential ATPGs,” IEEE Design & Test Conf., Paris (France), March 1996, pp. 75–379

    Google Scholar 

  8. A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, V. Sunderam, “PVM 3 User's Guide and Reference Manual,” Oak Ridge Nat. Lab., Internal Report ORNL/TM-12187, 1993

    Google Scholar 

  9. D.E. Goldberg, “Genetic Algorithms in Search, Optimization, and Machine Learning,” Addison-Wesley, 1989

    Google Scholar 

  10. T. Niermann, J.H. Patel, “HITEC: A Test Generator Package for Sequential Circuits,” Proc. European Design Automation Conf., 1991, pp. 214–218

    Google Scholar 

  11. P. Prinetto, M. Rebaudengo, M. Sonza Reorda, “An Automatic Test Pattern Generator for Large Sequential Circuits based on Genetic Algorithms,” Proc. Int. Test Conf., 1994, pp. 240–249

    Google Scholar 

  12. E.M. Rudnick, J.H. Patel, G.S. Greenstein, T.M. Niermann, “Sequential Circuit Test Generation in a Genetic Algorithm Framework,” Proc. Design Automation Conf., 1994, pp. 698–704

    Google Scholar 

  13. D. Schlierkamp-Voosen, H. Mühlenbein, “Strategy Adaptation by Competing Subpopulations,” Proc. Int. Conf. on Parallel Problem Solving from Nature, 1994, pp. 199–208

    Google Scholar 

  14. D.G. Saab, Y.G. Saab, J. Abraham, “CRIS: A Test Cultivation Program for Sequential VLSI Circuits,” Proc. Int. Conf. on Computer Aided Design, 1992, pp. 216–219

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Matteo Sonza Reorda .

Editor information

Hans-Michael Voigt Werner Ebeling Ingo Rechenberg Hans-Paul Schwefel

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Corno, F., Prinetto, P., Rebaudengo, M., Reorda, M.S. (1996). Exploiting competing subpopulations for automatic generation of test sequences for digital circuits. In: Voigt, HM., Ebeling, W., Rechenberg, I., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN IV. PPSN 1996. Lecture Notes in Computer Science, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61723-X_1042

Download citation

  • DOI: https://doi.org/10.1007/3-540-61723-X_1042

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61723-5

  • Online ISBN: 978-3-540-70668-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics