Publication Details

Accelerating Cellular Automata Evolution on Graphics Processing Units

ŽALOUDEK, L.; SEKANINA, L.; ŠIMEK, V. Accelerating Cellular Automata Evolution on Graphics Processing Units. International Journal on Advances in Software, 2010, vol. 3, no. 1, p. 294-303. ISSN: 1942-2628.
Czech title
Akcelerace evoluce celulárního automatu na grafické kartě
Type
journal article
Language
English
Authors
Žaloudek Luděk, Ing. (RG EHW)
Sekanina Lukáš, prof. Ing., Ph.D. (DCSY)
Šimek Václav, Ing. (DCSY)
URL
Keywords

cellular automata, parallel computing, GPU, CUDA,  genetic alghorithm

Abstract

As design of cellular automata rules using conventional methods is a difficult task, evolutionary algorithms are often utilized in this area. However, in that case, high computational demands need to be met. This problem may be partially solved by parallelization. Since parallel supercomputers and server clusters are expensive and often overburdened, this paper proposes the evolution of cellular automata rules on small and inexpensive graphic processing units. The main objective of this paper is to demonstrate that evolution of cellular automata rules can be accelerated significantly using graphics processing units. Several methods of speeding-up the evolution of cellular automata rules are proposed, evaluated and compared, some with very good results. Also a comparison is made between mid-end and high-end graphics accelerator card based on the results of evolution speedup. The proposed methods are evaluated using two benchmark problems.

Published
2010
Pages
294–303
Journal
International Journal on Advances in Software, vol. 3, no. 1, ISSN 1942-2628
BibTeX 
@article{BUT50515,
  author="Luděk {Žaloudek} and Lukáš {Sekanina} and Václav {Šimek}",
  title="Accelerating Cellular Automata Evolution on Graphics Processing Units",
  journal="International Journal on Advances in Software",
  year="2010",
  volume="3",
  number="1",
  pages="294--303",
  issn="1942-2628",
  url="https://www.fit.vut.cz/research/publication/9315/"
}
Back to top