Skip to main content

High Speed Hardware Computation of Co-evolution Models

  • Conference paper
Book cover Advances in Artificial Life (ECAL 1999)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1674))

Included in the following conference series:

Abstract

Field Programmable Gate Arrays (FPGAs) can provide the most suitable circuits for given problems by reconfiguring its circuits. In this paper, we show that a FPGA chip can achieve about 120 times of speedup compared with a workstation (Ultra-Sparc 200 MHz) in the computation of a co-evolution of strategies and scores in Iterated Prisoner’s Dilemma game. This speedup makes it possible to challenge more complex problems beyond the limitation by software.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Lindgren, “Evolutionary Phenomena in Simple Dynamics”, Artificial Life II, pp.295–312, 1991.

    Google Scholar 

  2. K. Lindgren and M. G. Nordah, “Cooperation and Community Structure in Artificial Ecosystems” Artificial Life 1, pp. 15–37, 1994.

    Article  Google Scholar 

  3. P. Graham and B. Nelson, “Genetic Algorithm In Software and In Hardware-A Performance Analysis of Workstation and Custom Computing Machine Implementations”, FPGAs for Custom Computing Machines, 1996 pp.216–225.

    Google Scholar 

  4. Stephen D. Scott, Ashok Samal and Shared Seth, HGA: “A Hardware-Based Genetic Algorithm” ACM/SIGDA 1995, pp.53–59

    Google Scholar 

  5. T. Maruyama, T. Funatsu and T. Hoshino, “A Field Programmable Gate-Array System for Evolutionary Computation” FPL’98 pp.356–365

    Google Scholar 

  6. David B. Fogel, “Evolving Behaviors in the Iterated Prisoner’s Dilemma”, Evolutionary Computation Vol.1:1, pp.77–97, 1993.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yamaguchi, Y., Maruyama, T., Hoshino, T. (1999). High Speed Hardware Computation of Co-evolution Models. In: Floreano, D., Nicoud, JD., Mondada, F. (eds) Advances in Artificial Life. ECAL 1999. Lecture Notes in Computer Science(), vol 1674. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48304-7_76

Download citation

  • DOI: https://doi.org/10.1007/3-540-48304-7_76

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66452-9

  • Online ISBN: 978-3-540-48304-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics