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.
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
K. Lindgren, “Evolutionary Phenomena in Simple Dynamics”, Artificial Life II, pp.295–312, 1991.
K. Lindgren and M. G. Nordah, “Cooperation and Community Structure in Artificial Ecosystems” Artificial Life 1, pp. 15–37, 1994.
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.
Stephen D. Scott, Ashok Samal and Shared Seth, HGA: “A Hardware-Based Genetic Algorithm” ACM/SIGDA 1995, pp.53–59
T. Maruyama, T. Funatsu and T. Hoshino, “A Field Programmable Gate-Array System for Evolutionary Computation” FPL’98 pp.356–365
David B. Fogel, “Evolving Behaviors in the Iterated Prisoner’s Dilemma”, Evolutionary Computation Vol.1:1, pp.77–97, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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