Detail publikace

Accelerating Cellular Automata Evolution on Graphics Processing Units

Originální název

Accelerating Cellular Automata Evolution on Graphics Processing Units

Anglický název

Accelerating Cellular Automata Evolution on Graphics Processing Units

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

BibTex


@article{BUT50515,
  author="Luděk {Žaloudek} and Lukáš {Sekanina} and Václav {Šimek}",
  title="Accelerating Cellular Automata Evolution on Graphics Processing Units",
  annote="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.",
  address="NEUVEDEN",
  chapter="50515",
  edition="NEUVEDEN",
  howpublished="print",
  institution="NEUVEDEN",
  number="1",
  volume="3",
  year="2010",
  month="september",
  pages="294--303",
  publisher="NEUVEDEN",
  type="journal article - other"
}