Comparison between Synchronous and Asynchronous Implementation of Parallel Genetic Programming

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

  author =       "Shisanu Tongchim and Prabhas Chongstitvatana",
  title =        "Comparison between Synchronous and Asynchronous
                 Implementation of Parallel Genetic Programming",
  booktitle =    "Proceedings of the Fifth International Symposium on
                 Artificial Life and Robotics (AROB)",
  year =         "2000",
  volume =       "1",
  editor =       "Masanori Sugisaka and Hirochi Tanaka",
  pages =        "251--254",
  month =        "26-28 " # jan,
  address =      "Oita, Japan",
  organisation = "International Society for Artificial Life and Robotics
  keywords =     "genetic algorithms, genetic programming",
  broken =       "",
  URL =          "",
  URL =          "",
  size =         "4 pages",
  abstract =     "An evolutionary method such as Genetic Programming
                 (GP) can be used to solve a large number of complex
                 problems in various application domains. However, one
                 obvious shortcoming of GP is that it usually uses a
                 substantial amount of processing time to arrive at a
                 solution. In this paper, we present the parallel
                 implementations that can reduce the processing time by
                 using a coarse-grained model for parallelisation and an
                 asynchronous migration. The problem chosen to examine
                 the parallel GP is a mobile robot navigation problem.
                 The experimental results show that superlinear speedup
                 of GP can be achieved.",
  notes =        "",

Genetic Programming entries for Shisanu Tongchim Prabhas Chongstitvatana