Parallelizing Three Dimensional Cellular Automata With OpenMP

Created by W.Langdon from gp-bibliography.bib Revision:1.4340

  author =       "Santiago {Garcia Carbajal}",
  title =        "Parallelizing Three Dimensional Cellular Automata With
  journal =      "Parallel Processing Letters",
  year =         "2007",
  volume =       "17",
  number =       "4",
  pages =        "349--361",
  month =        dec,
  email =        "",
  keywords =     "genetic algorithms, genetic programming, cellular
                 automata, Parallel Programming",
  ISSN =         "0129-6264",
  URL =          "",
  DOI =          "doi:10.1142/S0129626407003083",
  abstract =     "This paper describes our research on using Genetic
                 Programming to obtain transition rules for Cellular
                 Automata, which are one type of massively parallel
                 computing system. Our purpose is to determine the
                 existence of a limit of chaos for three dimensional
                 Cellular Automata, empirically demonstrated for the two
                 dimensional case. To do so, we must study statistical
                 properties of 3D Cellular Automata over long simulation
                 periods. When dealing with big three dimensional
                 meshes, applying the transition rule to the whole
                 structure can become a extremely slow task. In this
                 work we decompose the Automata into pieces and use
                 OpenMp to parallelise the process. Results show that
                 using a decomposition procedure, and distributing the
                 mesh between a set of processors, 3D Cellular Automata
                 can be studied without having long execution times.",
  notes =        "PPL",

Genetic Programming entries for Santiago Garcia Carbajal