X-Git-Url: https://git.octo.it/?p=sort-networks.git;a=blobdiff_plain;f=src%2Fsn-evolution.c;h=9f63506a6992dc94fad4a9225c47baed4716fb2a;hp=d9190b67ffda8bacd2d72e8e2bed3f86edfad803;hb=7113bfbc96eb65431bad9d9985ba04a18f4912cb;hpb=a0a30cedf11c449c8b3262c4e45ea3d3312a4d93 diff --git a/src/sn-evolution.c b/src/sn-evolution.c index d9190b6..9f63506 100644 --- a/src/sn-evolution.c +++ b/src/sn-evolution.c @@ -1,6 +1,6 @@ /** - * collectd - src/sn-evolution.c - * Copyright (C) 2008 Florian octo Forster + * libsortnetwork - src/sn-evolution.c + * Copyright (C) 2008-2010 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 @@ -16,20 +16,24 @@ * 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * Authors: - * Florian octo Forster + * Florian octo Forster **/ #ifndef _ISOC99_SOURCE # define _ISOC99_SOURCE #endif #ifndef _POSIX_C_SOURCE -# define _POSIX_C_SOURCE 200112L +# define _POSIX_C_SOURCE 200809L +#endif +#ifndef _XOPEN_SOURCE +# define _XOPEN_SOURCE 700 #endif #include #include #include #include +#include #include #include @@ -41,16 +45,18 @@ #include +#include + #include "sn_network.h" -#include "sn_population.h" #include "sn_random.h" -/* Yes, this is ugly, but the GNU libc doesn't export it with the above flags. - * */ -char *strdup (const char *s); +#if !defined(__GNUC__) || !__GNUC__ +# define __attribute__(x) /**/ +#endif static uint64_t iteration_counter = 0; static int inputs_num = 16; +static int inputs_num_is_power_of_two = 1; static char *initial_input_file = NULL; static char *best_output_file = NULL; @@ -58,11 +64,20 @@ static char *best_output_file = NULL; static int stats_interval = 0; static int max_population_size = 128; -static sn_population_t *population; +static population_t *population; + +static enum +{ + MERGER_ODDEVEN, + MERGER_BITONIC, + MERGER_RANDOM +} selected_merger = MERGER_ODDEVEN; + +static int evolution_threads_num = 4; static int do_loop = 0; -static void sigint_handler (int signal) +static void sigint_handler (int signal __attribute__((unused))) { do_loop++; } /* void sigint_handler */ @@ -75,6 +90,10 @@ static void exit_usage (const char *name) " -i Initial input file (REQUIRED)\n" " -o Write the current best solution to \n" " -p Size of the population (default: 128)\n" + " -P Send individuals to (may be repeated)\n" + " -t Number of threads (default: 4)\n" + " -m Specify the merging network to use.\n" + " Available: \"oddeven\", \"bitonic\", \"random\"\n" "\n", name); exit (1); @@ -84,7 +103,7 @@ int read_options (int argc, char **argv) { int option; - while ((option = getopt (argc, argv, "i:o:p:P:s:h")) != -1) + while ((option = getopt (argc, argv, "i:o:p:P:s:t:m:h")) != -1) { switch (option) { @@ -108,7 +127,23 @@ int read_options (int argc, char **argv) { int tmp = atoi (optarg); if (tmp > 0) + { max_population_size = tmp; + population_set_size (population, (size_t) max_population_size); + } + break; + } + + case 'P': + { + int status; + + status = population_add_peer (population, optarg, /* port = */ NULL); + if (status != 0) + { + fprintf (stderr, "population_add_peer failed with status %i.\n", + status); + } break; } @@ -120,6 +155,27 @@ int read_options (int argc, char **argv) break; } + case 't': + { + int tmp = atoi (optarg); + if (tmp >= 1) + evolution_threads_num = tmp; + break; + } + + case 'm': + { + if (strcasecmp ("oddeven", optarg) == 0) + selected_merger = MERGER_ODDEVEN; + else if (strcasecmp ("bitonic", optarg) == 0) + selected_merger = MERGER_BITONIC; + else if (strcasecmp ("random", optarg) == 0) + selected_merger = MERGER_RANDOM; + else + fprintf (stderr, "Not a valid merging strategy: \"%s\"\n", optarg); + break; + } + case 'h': default: exit_usage (argv[0]); @@ -129,6 +185,22 @@ int read_options (int argc, char **argv) return (0); } /* int read_options */ +static int rate_network (const sn_network_t *n) +{ + int rate; + int i; + + rate = SN_NETWORK_STAGE_NUM (n) * SN_NETWORK_INPUT_NUM (n); + for (i = 0; i < SN_NETWORK_STAGE_NUM (n); i++) + { + sn_stage_t *s = SN_NETWORK_STAGE_GET (n, i); + rate += SN_STAGE_COMP_NUM (s); + } + + return (rate); +} /* int rate_network */ + +#if 0 static int mutate_network (sn_network_t *n) { sn_network_t *n_copy; @@ -166,6 +238,7 @@ static int mutate_network (sn_network_t *n) return (0); } /* int mutate_network */ +#endif static int create_offspring (void) { @@ -173,14 +246,19 @@ static int create_offspring (void) sn_network_t *p1; sn_network_t *n; - p0 = sn_population_pop (population); - p1 = sn_population_pop (population); + p0 = population_get_random (population); + p1 = population_get_random (population); assert (p0 != NULL); assert (p1 != NULL); /* combine the two parents */ - n = sn_network_combine (p0, p1); + if ((selected_merger == MERGER_ODDEVEN) + || ((selected_merger == MERGER_RANDOM) + && (sn_bounded_random (0, 1) == 0))) + n = sn_network_combine_odd_even_merge (p0, p1); + else + n = sn_network_combine_bitonic_merge (p0, p1); sn_network_destroy (p0); sn_network_destroy (p1); @@ -204,17 +282,19 @@ static int create_offspring (void) assert (SN_NETWORK_INPUT_NUM (n) == inputs_num); - if (sn_bounded_random (0, 100) <= 1) +#if 0 + if ((SN_NETWORK_INPUT_NUM (n) <= 16) && (sn_bounded_random (0, 100) <= 1)) mutate_network (n); +#endif - sn_population_push (population, n); + population_insert (population, n); sn_network_destroy (n); return (0); } /* int create_offspring */ -static void *evolution_thread (void *arg) +static void *evolution_thread (void *arg __attribute__((unused))) { while (do_loop == 0) { @@ -253,11 +333,33 @@ static int evolution_start (int threads_num) status = sleep (1); if (status == 0) { - int best_rating; - i = iteration_counter; + sn_network_t *n; + int stages_num; + int comparators_num; + int rating; + int iter; + + iter = iteration_counter; + + n = population_get_fittest (population); + + rating = rate_network (n); - best_rating = sn_population_best_rating (population); - printf ("After approximately %i iterations: Currently best rating: %i\n", i, best_rating); + stages_num = SN_NETWORK_STAGE_NUM (n); + comparators_num = 0; + for (i = 0; i < stages_num; i++) + { + sn_stage_t *s; + + s = SN_NETWORK_STAGE_GET (n, i); + comparators_num += SN_STAGE_COMP_NUM (s); + } + + sn_network_destroy (n); + + printf ("Best after approximately %i iterations: " + "%i comparators in %i stages. Rating: %i.\n", + iter, comparators_num, stages_num, rating); } } @@ -276,6 +378,19 @@ int main (int argc, char **argv) struct sigaction sigint_action; struct sigaction sigterm_action; + population = population_create ((pi_rate_f) rate_network, + (pi_copy_f) sn_network_clone, + (pi_free_f) sn_network_destroy); + if (population == NULL) + { + fprintf (stderr, "population_create failed.\n"); + return (1); + } + + population_set_serialization (population, + (pi_serialize_f) sn_network_serialize, + (pi_unserialize_f) sn_network_unserialize); + read_options (argc, argv); if (initial_input_file == NULL) exit_usage (argv[0]); @@ -288,15 +403,11 @@ int main (int argc, char **argv) sigterm_action.sa_handler = sigint_handler; sigaction (SIGTERM, &sigterm_action, NULL); - population = sn_population_create (max_population_size); - if (population == NULL) - { - fprintf (stderr, "sn_population_create failed.\n"); - return (1); - } + population_start_listen_thread (population, NULL, NULL); { sn_network_t *n; + int tmp; n = sn_network_read_file (initial_input_file); if (n == NULL) @@ -307,7 +418,24 @@ int main (int argc, char **argv) inputs_num = SN_NETWORK_INPUT_NUM(n); - sn_population_push (population, n); + /* Determine if `inputs_num' is a power of two. If so, more merge + * algorithms can be used. */ + tmp = inputs_num; + inputs_num_is_power_of_two = 1; + while (tmp > 0) + { + if ((tmp % 2) != 0) + { + if (tmp == 1) + inputs_num_is_power_of_two = 1; + else + inputs_num_is_power_of_two = 0; + break; + } + tmp = tmp >> 1; + } + + population_insert (population, n); sn_network_destroy (n); } @@ -318,7 +446,7 @@ int main (int argc, char **argv) "=======================\n", initial_input_file, inputs_num, max_population_size); - evolution_start (3); + evolution_start (evolution_threads_num); printf ("Exiting after %llu iterations.\n", (unsigned long long) iteration_counter); @@ -326,18 +454,17 @@ int main (int argc, char **argv) { sn_network_t *n; - n = sn_population_best (population); + n = population_get_fittest (population); if (n != NULL) { if (best_output_file != NULL) sn_network_write_file (n, best_output_file); - else - sn_network_show (n); + sn_network_show (n); sn_network_destroy (n); } } - sn_population_destroy (population); + population_destroy (population); return (0); } /* int main */