X-Git-Url: https://git.octo.it/?a=blobdiff_plain;f=src%2Fsn-evolution.c;h=b6c37b473ca5345c4dd7ba806688783b0add0702;hb=9cbc448819152a9adde2b42439426ee874a30fc3;hp=d3184d928ae94c1fd02e360209b8f9b41f89f8eb;hpb=59ace47e99699dfefeb4ea10fc1f41288d0b951d;p=sort-networks.git diff --git a/src/sn-evolution.c b/src/sn-evolution.c index d3184d9..b6c37b4 100644 --- a/src/sn-evolution.c +++ b/src/sn-evolution.c @@ -1,8 +1,30 @@ +/** + * collectd - src/sn-evolution.c + * Copyright (C) 2008 Florian octo Forster + * + * This program is free software; you can redistribute it and/or modify it + * under the terms of the GNU General Public License as published by the + * Free Software Foundation; only version 2 of the License is applicable. + * + * This program is distributed in the hope that it will be useful, but + * WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + * General Public License for more details. + * + * You should have received a copy of the GNU General Public License along + * with this program; if not, write to the Free Software Foundation, Inc., + * 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA + * + * Authors: + * Florian octo Forster + **/ + #define _ISOC99_SOURCE #define _POSIX_C_SOURCE 200112L #include #include +#include #include #include @@ -13,60 +35,97 @@ #include #include +#include + #include "sn_network.h" +#include "sn_population.h" +#include "sn_random.h" -struct population_entry_s -{ - sn_network_t *network; - int rating; -}; -typedef struct population_entry_s population_entry_t; +/* Yes, this is ugly, but the GNU libc doesn't export it with the above flags. + * */ +char *strdup (const char *s); + +static uint64_t iteration_counter = 0; +static int inputs_num = 16; + +static char *initial_input_file = NULL; +static char *best_output_file = NULL; + +static int stats_interval = 0; -static int iterations_num = INT_MAX; static int max_population_size = 128; -static int olymp_size = 96; -static int inputs_num = 16; +static sn_population_t *population; -static population_entry_t *population = NULL; -int population_size = 0; +static int do_loop = 0; static void sigint_handler (int signal) { - iterations_num = 0; + do_loop++; } /* void sigint_handler */ -static int init_random (void) +static void exit_usage (const char *name) +{ + printf ("Usage: %s [options]\n" + "\n" + "Valid options are:\n" + " -i Initial input file (REQUIRED)\n" + " -o Write the current best solution to \n" + " -p Size of the population (default: 128)\n" + "\n", + name); + exit (1); +} /* void exit_usage */ + +int read_options (int argc, char **argv) { - int fd; - unsigned int r; + int option; - fd = open ("/dev/random", O_RDONLY); - if (fd < 0) + while ((option = getopt (argc, argv, "i:o:p:P:s:h")) != -1) { - perror ("open"); - return (-1); - } + switch (option) + { + case 'i': + { + if (initial_input_file != NULL) + free (initial_input_file); + initial_input_file = strdup (optarg); + break; + } - read (fd, (void *) &r, sizeof (r)); - close (fd); + case 'o': + { + if (best_output_file != NULL) + free (best_output_file); + best_output_file = strdup (optarg); + break; + } - srand (r); + case 'p': + { + int tmp = atoi (optarg); + if (tmp > 0) + max_population_size = tmp; + break; + } - return (0); -} /* int init_random */ + case 's': + { + int tmp = atoi (optarg); + if (tmp > 0) + stats_interval = tmp; + break; + } -static int bounded_random (int upper_bound) -{ - double r = ((double) rand ()) / ((double) RAND_MAX); - return ((int) (r * upper_bound)); -} + case 'h': + default: + exit_usage (argv[0]); + } + } -static void exit_usage (const char *name) -{ - printf ("%s \n", name); - exit (1); -} /* void exit_usage */ + return (0); +} /* int read_options */ +#if 0 static int rate_network (const sn_network_t *n) { int rate; @@ -81,7 +140,9 @@ static int rate_network (const sn_network_t *n) return (rate); } /* int rate_network */ +#endif +#if 0 static int population_print_stats (int iterations) { int best = -1; @@ -100,12 +161,15 @@ static int population_print_stats (int iterations) return (0); } /* int population_print_stats */ +#endif +#if 0 static int insert_into_population (sn_network_t *n) { int rating; int worst_rating; int worst_index; + int best_rating; int nmemb; int i; @@ -121,12 +185,33 @@ static int insert_into_population (sn_network_t *n) worst_rating = -1; worst_index = -1; + best_rating = -1; for (i = 0; i < olymp_size; i++) + { if (population[i].rating > worst_rating) { worst_rating = population[i].rating; worst_index = i; } + if ((population[i].rating < best_rating) + || (best_rating == -1)) + best_rating = population[i].rating; + } + + if (rating < best_rating) + { + if (best_output_file != NULL) + { + printf ("Writing network with rating %i to %s\n", + rating, best_output_file); + sn_network_write_file (n, best_output_file); + } + else + { + printf ("New best solution has rating %i\n", + rating); + } + } nmemb = max_population_size - (worst_index + 1); @@ -142,122 +227,172 @@ static int insert_into_population (sn_network_t *n) return (0); } /* int insert_into_population */ +#endif static int create_offspring (void) { - int p0; - int p1; + sn_network_t *p0; + sn_network_t *p1; sn_network_t *n; - p0 = bounded_random (population_size); - p1 = bounded_random (population_size); + p0 = sn_population_pop (population); + p1 = sn_population_pop (population); + + assert (p0 != NULL); + assert (p1 != NULL); + + /* combine the two parents */ + n = sn_network_combine (p0, p1); - n = sn_network_combine (population[p0].network, population[p1].network); + sn_network_destroy (p0); + sn_network_destroy (p1); + /* randomly chose an input and do a min- or max-cut. */ while (SN_NETWORK_INPUT_NUM (n) > inputs_num) { int pos; enum sn_network_cut_dir_e dir; - pos = bounded_random (SN_NETWORK_INPUT_NUM (n)); - dir = (bounded_random (2) == 0) ? DIR_MIN : DIR_MAX; + pos = sn_bounded_random (0, SN_NETWORK_INPUT_NUM (n) - 1); + dir = (sn_bounded_random (0, 1) == 0) ? DIR_MIN : DIR_MAX; assert ((pos >= 0) && (pos < SN_NETWORK_INPUT_NUM (n))); sn_network_cut_at (n, pos, dir); } + /* compress the network to get a compact representation */ sn_network_compress (n); assert (SN_NETWORK_INPUT_NUM (n) == inputs_num); - insert_into_population (n); + sn_population_push (population, n); + + sn_network_destroy (n); return (0); } /* int create_offspring */ -static int start_evolution (void) +static void *evolution_thread (void *arg) { + while (do_loop == 0) + { + create_offspring (); + /* XXX: Not synchronized! */ + iteration_counter++; + } + + return ((void *) 0); +} /* int start_evolution */ + +static int evolution_start (int threads_num) +{ + pthread_t threads[threads_num]; /* C99 ftw! */ int i; - for (i = 0; i < iterations_num; i++) + for (i = 0; i < threads_num; i++) { - if ((i % 1000) == 0) - population_print_stats (i); + int status; - create_offspring (); + status = pthread_create (&threads[i], /* attr = */ NULL, + evolution_thread, /* arg = */ NULL); + if (status != 0) + { + fprintf (stderr, "evolution_start: pthread_create[%i] failed " + "with status %i.\n", + i, status); + threads[i] = 0; + } + } + + while (do_loop == 0) + { + int status; + + status = sleep (1); + if (status == 0) + { + int best_rating; + i = iteration_counter; + + best_rating = sn_population_best_rating (population); + printf ("After approximately %i iterations: Currently best rating: %i\n", i, best_rating); + } + } + + for (i = 0; i < threads_num; i++) + { + if (threads[i] == 0) + continue; + pthread_join (threads[i], /* value_ptr = */ NULL); } return (0); -} /* int start_evolution */ +} /* int evolution_start */ int main (int argc, char **argv) { struct sigaction sigint_action; - if (argc != 2) + read_options (argc, argv); + if (initial_input_file == NULL) exit_usage (argv[0]); - init_random (); - memset (&sigint_action, '\0', sizeof (sigint_action)); sigint_action.sa_handler = sigint_handler; sigaction (SIGINT, &sigint_action, NULL); - population = (population_entry_t *) malloc (max_population_size - * sizeof (population_entry_t)); + population = sn_population_create (max_population_size); if (population == NULL) { - printf ("Malloc failed.\n"); - return (-1); + fprintf (stderr, "sn_population_create failed.\n"); + return (1); } - memset (population, '\0', max_population_size - * sizeof (population_entry_t)); { - sn_network_t *n = sn_network_read_file (argv[1]); + sn_network_t *n; + + n = sn_network_read_file (initial_input_file); if (n == NULL) { printf ("n == NULL\n"); return (1); } - population[0].network = n; - population[0].rating = rate_network (n); - population_size++; - } - start_evolution (); + inputs_num = SN_NETWORK_INPUT_NUM(n); - { - int i; - int best_rate = -1; - int best_index = -1; + sn_population_push (population, n); + sn_network_destroy (n); + } - for (i = 0; i < population_size; i++) - { - if ((best_rate == -1) || (best_rate > population[i].rating)) - { - best_rate = population[i].rating; - best_index = i; - } - } + printf ("Current configuration:\n" + " Initial network: %s\n" + " Number of inputs: %3i\n" + " Population size: %3i\n" + "=======================\n", + initial_input_file, inputs_num, max_population_size); - sn_network_show (population[best_index].network); - } + evolution_start (3); + + printf ("Exiting after %llu iterations.\n", + (unsigned long long) iteration_counter); { - int i; + sn_network_t *n; - for (i = 0; i < population_size; i++) + n = sn_population_best (population); + if (n != NULL) { - sn_network_destroy (population[i].network); - population[i].network = NULL; + if (best_output_file != NULL) + sn_network_write_file (n, best_output_file); + else + sn_network_show (n); + sn_network_destroy (n); } - - free (population); - population = 0; } + sn_population_destroy (population); + return (0); } /* int main */