@Article{Comellas:1998:GPD,
author = "F. Comellas and G. Gim{\'e}nez",
title = "Genetic Programming to Design Communication Algorithms
for Parallel Architectures",
journal = "Parallel Processing Letters",
year = "1998",
volume = "8",
number = "4",
pages = "549560",
keywords = "genetic algorithms, genetic programming, broadcasting,
networks, butterfly graph",
size = "12 pages",
abstract = "Broadcasting is an information dissemination problem
in which a message originating at one node of a
communication network (modeled as a graph) is to be
sent to all other nodes as quickly as possible. This
paper describes a new way of producing broadcasting
schemes using genetic programming. This technique has
proven successful by easily finding optimal algorithms
for several wellknown families of networks (grids,
hypercubes and cycle connected cubes) and has indeed
generated a new scheme for butterflies that improves
the known upper bound for the broadcasting time of
these networks.",
notes = "GPQUICK. Tried on 4 problems (5x5 directed grid,
torroidal, hypercube, cube connected cycles) finds
known optima.
{"}5.5 Butterfly graph For these graphs no optimal
broadcasting algorithm is known... we improve the upper
bound to BF_k \le 2k2{"} for k=7,8...16",
CODEN = "PPLTEE",
ISSN = "01296264",
URL = "http://wwwmat.upc.es/~comellas/genprog/genprog.html",
acknowledgement = acknhfb,
bibdate = "Mon Nov 09 07:22:43 1998",
}
