Advertisement

High-Performance Hardware Design and Implementation of Genetic Algorithms

  • Barry Shackleford
  • Etsuko Okushi
  • Mitsuhiro Yasuda
  • Hisao Koizumi
  • Katsuhiko Seo
  • Takahashi Iwamoto
  • Hiroto Yasuura
Part of the Studies in Fuzziness and Soft Computing book series (STUDFUZZ, volume 74)

Abstract

In this chapter, we present a survival-based, steady-state GA designed for efficient implementation in hardware and the design of a pipelined genetic algorithm processor that can generate one new, evaluated chromosome per machine cycle. High performance is obtained by implementing the functions of parent selection, crossover, mutation, evaluation, and survival in hardware in such a manner that each function can be executed in a single machine cycle. When these hardware functions are connected in a linear pipeline (much the same as an assembly line), the net result is the generation a new child chromosome on each machine cycle. The key features of the survival-based, steady-state GA are low selection pressure due to random parent selection, steady-state population maintenance, and replacement of randomly discovered, lesser-fit chromosomes by more-fit offspring. A GA machine prototype is also presented, running at 1 MHz and generating one million new chromosomes per second.

Keywords

Genetic Algorithm Hardware Implementation Penalty Cost Connection Matrix Machine Cycle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, 1975. (Second edition: MIT Press, 1992.)Google Scholar
  2. [2]
    D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, 1989.Google Scholar
  3. [3]
    M. Mitchell, An Introduction to Genetic Algorithms, MIT Press, 1996.Google Scholar
  4. [4]
    K. A. De Jong and W. M. Spears, “Using genetic algorithms to solve NP-complete problems,” Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann, pp. 124–132, 1989.Google Scholar
  5. [5]
    J. J. Grefenstette, R. Gopal, B. Rosmaita, D. Van Gucht, “Genetic algorithms for the traveling salesman problem,” Proceedings of the First International Conference on Genetic Algorithms, Morgan Kaufmann, pp. 160–168, 1985.Google Scholar
  6. [6]
    H. Mühlenbein, “Parallel genetic algorithms, population genetics, and combinatorial optimization,” Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann, pp. 416–421, 1989.Google Scholar
  7. [7]
    D. Andre and J. R. Koza, “Parallel genetic programming: A scalable implementation using the transputer network architecture,” in P. J. Angeline and K. E. Kinnear Jr., eds., Advances in Genetic Programming 2, MIT Press, ch. 16, 1996.Google Scholar
  8. [8]
    P. Nordin, “A compiling genetic programming system that directly manipulates the machine code,” in K. E. Kinnear Jr., ed., Advances in Genetic Programming, MIT Press, pp. 311–331, 1994.Google Scholar
  9. [9]
    P. Graham and B. Nelson, “A hardware genetic algorithm for the traveling salesman problem on Splash 2,” in Field-Programmable Logic and Applications, ed. W. Moore and W. Luk, pp. 352–361, Springer, Oxford, 1995.Google Scholar
  10. [10]
    N. Sitkoff, M. Wazlowski, A. Smith, and H. Silverman, “Implementing a genetic algorithm on a parallel custom computing machine,” Proceedings of the IEEE Workshop on FPGAs for Custom Computing Machines, pp. 180–187, 1995.Google Scholar
  11. [11]
    J. M. Arnold, D. A. Buell, and E. G. Davis, “Splash 2,” Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 316–324, June 1992.Google Scholar
  12. [12]
    M. Wazlowski, A. Smith, R. Citro, and H. Silverman, “Armstrong III: A loosely coupled parallel processor with reconfigurable computing capabilities,” Technical Report, Division of Engineering, Brown University, 1994.Google Scholar
  13. [13]
    B. Shackleford, E. Okushi, M. Yasuda, H. Koizumi, K. Seo, and T. Iwamoto, “Hardware framework for accelerating the execution speed of a genetic algorithm,” IEICE Transactions on Electronics, vol. E80-C, no. 7, pp. 962969, July 1997.Google Scholar
  14. [14]
    B. Shackleford, E. Okushi, M. Yasuda, H. Koizumi, K. Seo, T. Iwamoto, and H. Yasuura, “A high-performance implementation of a survival-based genetic algorithm,” The Fourth International Conference on Neural Information Processing—ICONIP’97, Dunedin, New Zealand, pp. 686691, Nov. 1997.Google Scholar
  15. [15]
    G. Syswerda, “Uniform crossover in genetic algorithms,” Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann, pp. 2–9, 1989.Google Scholar
  16. [16]
    G. Syswerda, “A study of reproduction in generational and steady-state genetic algorithms,” Foundations of Genetic Algorithms, G. Rawlins, ed., Morgan Kaufmann, pp. 94–101, 1991.Google Scholar
  17. [17]
    M. Mitchell, S. Forrest, and J. H. Holland, “The royal road for genetic algorithms. Fitness landscapes and GA performance,” in F. J. Varela and P. Bourgine, eds., Towards a Practice of Autonomous Systems: Proceedings of the First European Conference on Artificial Life, MIT Press, 1992.Google Scholar
  18. [18]
    S. Forrest and M. Mitchell, “Relative building block fitness and building block hypothesis,” in L. D. Whitley, ed., Foundations of Genetic Algorithms 2, Morgan Kaufmann, 1993.Google Scholar
  19. [19]
    M. Mitchell, J. H. Holland, and S. Forrest, “When will a genetic algorithm outperform hill climbing?” in J. D. Cowan, G. Tesauro, and J. Alspector, eds., Advances in Neural Information Processing Systems 6, Morgan Kaufmann, 1994.Google Scholar
  20. [20]
    D. A. Patterson and J. L. Hennessy, Computer Architecture: A Quantitative Approach, Morgan Kaufmann, 1990.Google Scholar
  21. [21]
    S. Wolfram, “Random sequence generation by cellular automata,” Advances Appl. Math., vol. 7, pp. 123–169, 1986. (Also in S. Wolfram, Theory and Applications of Cellular Automata, World Scientific, 1986.)Google Scholar
  22. [22]
    T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press, 1990.Google Scholar
  23. [23]
    T. Iwamoto, “Genetic algorithms for set covering problems” (in Japanese), The Sixth Intelligent System Symposium, The Japan Society of Mechanical Engineers, Osaka, pp. 73–74, Oct. 1996.Google Scholar
  24. [24]
    O. Coudert, “On solving covering problems,” Proceedings of the 33rd Design Automation Conference, pp. 197–202, June 1996.Google Scholar
  25. [25]
    E. L. McCluskey Jr., “Minimization of boolean functions,” Bell System Technical Journal, vol. 35, pp. 1417–1444, April 1959.Google Scholar
  26. [26]
    W. V. Quine, “On cores and prime implicants of truth functions,” American Math. Monthly, vol. 66, pp. 755–760, 1959.Google Scholar
  27. [27]
    D. D. Gajski, Principles of Digital Design, Prentice Hall, 1997.Google Scholar
  28. [28]
    M. Karnaugh, “A map method for synthesis of combinatorial logic circuits,” Transactions of the AIEE, Communications and Electronics, vol. 72, part I, pp. 593–599, Nov. 1953.Google Scholar
  29. [29]
    W. B. Culbertson, T. Osame, Y. Otsuru, J. B. Shackleford, and M. Tanaka, “The HP Tsutsuji logic synthesis system,” Hewlett-Packard Journal, pp. 38–51, Aug. 1993.Google Scholar
  30. [30]
    H. Koizumi, K. Seo, F. Suzuki, Y. Ohtsuru, and H. Yasuura, “A proposal for a co-design method in control systems using combination of models,” IEICE Transactions on Information and Systems, vol. E78-D, no. 3, pp. 237–247, March 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Barry Shackleford
    • 1
  • Etsuko Okushi
    • 2
  • Mitsuhiro Yasuda
    • 2
  • Hisao Koizumi
    • 2
  • Katsuhiko Seo
    • 2
  • Takahashi Iwamoto
    • 2
  • Hiroto Yasuura
    • 3
  1. 1.Computer Systems and Technology LaboratoryHewlett-Packard LaboratoriesPalo AltoUSA
  2. 2.Mitsubishi Electric CorporationKamakura-shiJapan
  3. 3.Graduate School of Engineering SciencesKyushu UniversityKasuga-shi, 816Japan

Personalised recommendations