2 * collectd - src/sn-evolution.c
3 * Copyright (C) 2008 Florian octo Forster
5 * This program is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License as published by the
7 * Free Software Foundation; only version 2 of the License is applicable.
9 * This program is distributed in the hope that it will be useful, but
10 * WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * General Public License for more details.
14 * You should have received a copy of the GNU General Public License along
15 * with this program; if not, write to the Free Software Foundation, Inc.,
16 * 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
19 * Florian octo Forster <octo at verplant.org>
22 #ifndef _ISOC99_SOURCE
23 # define _ISOC99_SOURCE
25 #ifndef _POSIX_C_SOURCE
26 # define _POSIX_C_SOURCE 200112L
34 #include <sys/types.h>
44 #include <population.h>
46 #include "sn_network.h"
47 #include "sn_random.h"
49 /* Yes, this is ugly, but the GNU libc doesn't export it with the above flags.
51 char *strdup (const char *s);
53 static uint64_t iteration_counter = 0;
54 static int inputs_num = 16;
56 static char *initial_input_file = NULL;
57 static char *best_output_file = NULL;
59 static int stats_interval = 0;
61 static int max_population_size = 128;
62 static population_t *population;
64 static int evolution_threads_num = 4;
66 static int do_loop = 0;
68 static void sigint_handler (int signal)
71 } /* void sigint_handler */
73 static void exit_usage (const char *name)
75 printf ("Usage: %s [options]\n"
77 "Valid options are:\n"
78 " -i <file> Initial input file (REQUIRED)\n"
79 " -o <file> Write the current best solution to <file>\n"
80 " -p <num> Size of the population (default: 128)\n"
81 " -P <peer> Send individuals to <peer> (may be repeated)\n"
82 " -t <num> Number of threads (default: 4)\n"
86 } /* void exit_usage */
88 int read_options (int argc, char **argv)
92 while ((option = getopt (argc, argv, "i:o:p:P:s:t:h")) != -1)
98 if (initial_input_file != NULL)
99 free (initial_input_file);
100 initial_input_file = strdup (optarg);
106 if (best_output_file != NULL)
107 free (best_output_file);
108 best_output_file = strdup (optarg);
114 int tmp = atoi (optarg);
117 max_population_size = tmp;
118 population_set_size (population, (size_t) max_population_size);
127 status = population_add_peer (population, optarg, /* port = */ NULL);
130 fprintf (stderr, "population_add_peer failed with status %i.\n",
138 int tmp = atoi (optarg);
140 stats_interval = tmp;
146 int tmp = atoi (optarg);
148 evolution_threads_num = tmp;
154 exit_usage (argv[0]);
159 } /* int read_options */
161 static int rate_network (const sn_network_t *n)
166 rate = SN_NETWORK_STAGE_NUM (n) * SN_NETWORK_INPUT_NUM (n);
167 for (i = 0; i < SN_NETWORK_STAGE_NUM (n); i++)
169 sn_stage_t *s = SN_NETWORK_STAGE_GET (n, i);
170 rate += SN_STAGE_COMP_NUM (s);
174 } /* int rate_network */
176 static int mutate_network (sn_network_t *n)
178 sn_network_t *n_copy;
181 int comparator_index;
184 n_copy = sn_network_clone (n);
187 fprintf (stderr, "mutate_network: sn_network_clone failed.\n");
191 stage_index = sn_bounded_random (0, SN_NETWORK_STAGE_NUM (n_copy) - 1);
192 s = SN_NETWORK_STAGE_GET (n_copy, stage_index);
194 comparator_index = sn_bounded_random (0, SN_STAGE_COMP_NUM (s) - 1);
195 sn_stage_comparator_remove (s, comparator_index);
197 status = sn_network_brute_force_check (n_copy);
199 sn_network_destroy (n_copy);
203 else if (status > 0) /* Mutated network does not sort anymore. */
206 /* We saved one comparator \o/ Let's do the same change on the original
208 s = SN_NETWORK_STAGE_GET (n, stage_index);
209 sn_stage_comparator_remove (s, comparator_index);
212 } /* int mutate_network */
214 static int create_offspring (void)
220 p0 = population_get_random (population);
221 p1 = population_get_random (population);
226 /* combine the two parents */
227 n = sn_network_combine (p0, p1);
229 sn_network_destroy (p0);
230 sn_network_destroy (p1);
232 /* randomly chose an input and do a min- or max-cut. */
233 while (SN_NETWORK_INPUT_NUM (n) > inputs_num)
236 enum sn_network_cut_dir_e dir;
238 pos = sn_bounded_random (0, SN_NETWORK_INPUT_NUM (n) - 1);
239 dir = (sn_bounded_random (0, 1) == 0) ? DIR_MIN : DIR_MAX;
241 assert ((pos >= 0) && (pos < SN_NETWORK_INPUT_NUM (n)));
243 sn_network_cut_at (n, pos, dir);
246 /* compress the network to get a compact representation */
247 sn_network_compress (n);
249 assert (SN_NETWORK_INPUT_NUM (n) == inputs_num);
251 if ((SN_NETWORK_INPUT_NUM (n) <= 16) && (sn_bounded_random (0, 100) <= 1))
254 population_insert (population, n);
256 sn_network_destroy (n);
259 } /* int create_offspring */
261 static void *evolution_thread (void *arg)
266 /* XXX: Not synchronized! */
271 } /* int start_evolution */
273 static int evolution_start (int threads_num)
275 pthread_t threads[threads_num]; /* C99 ftw! */
278 for (i = 0; i < threads_num; i++)
282 status = pthread_create (&threads[i], /* attr = */ NULL,
283 evolution_thread, /* arg = */ NULL);
286 fprintf (stderr, "evolution_start: pthread_create[%i] failed "
306 iter = iteration_counter;
308 n = population_get_fittest (population);
310 rating = rate_network (n);
312 stages_num = SN_NETWORK_STAGE_NUM (n);
314 for (i = 0; i < stages_num; i++)
318 s = SN_NETWORK_STAGE_GET (n, i);
319 comparators_num += SN_STAGE_COMP_NUM (s);
322 sn_network_destroy (n);
324 printf ("Best after approximately %i iterations: "
325 "%i comparators in %i stages. Rating: %i.\n",
326 iter, comparators_num, stages_num, rating);
330 for (i = 0; i < threads_num; i++)
334 pthread_join (threads[i], /* value_ptr = */ NULL);
338 } /* int evolution_start */
340 int main (int argc, char **argv)
342 struct sigaction sigint_action;
343 struct sigaction sigterm_action;
345 population = population_create ((pi_rate_f) rate_network,
346 (pi_copy_f) sn_network_clone,
347 (pi_free_f) sn_network_destroy);
348 if (population == NULL)
350 fprintf (stderr, "population_create failed.\n");
354 population_set_serialization (population,
355 (pi_serialize_f) sn_network_serialize,
356 (pi_unserialize_f) sn_network_unserialize);
358 read_options (argc, argv);
359 if (initial_input_file == NULL)
360 exit_usage (argv[0]);
362 memset (&sigint_action, '\0', sizeof (sigint_action));
363 sigint_action.sa_handler = sigint_handler;
364 sigaction (SIGINT, &sigint_action, NULL);
366 memset (&sigterm_action, '\0', sizeof (sigterm_action));
367 sigterm_action.sa_handler = sigint_handler;
368 sigaction (SIGTERM, &sigterm_action, NULL);
370 population_start_listen_thread (population, NULL, NULL);
375 n = sn_network_read_file (initial_input_file);
378 printf ("n == NULL\n");
382 inputs_num = SN_NETWORK_INPUT_NUM(n);
384 population_insert (population, n);
385 sn_network_destroy (n);
388 printf ("Current configuration:\n"
389 " Initial network: %s\n"
390 " Number of inputs: %3i\n"
391 " Population size: %3i\n"
392 "=======================\n",
393 initial_input_file, inputs_num, max_population_size);
395 evolution_start (evolution_threads_num);
397 printf ("Exiting after %llu iterations.\n",
398 (unsigned long long) iteration_counter);
403 n = population_get_fittest (population);
406 if (best_output_file != NULL)
407 sn_network_write_file (n, best_output_file);
409 sn_network_destroy (n);
413 population_destroy (population);
418 /* vim: set shiftwidth=2 softtabstop=2 : */