wanlinksolve.cc 23.9 KB
Newer Older
Leigh B. Stoller's avatar
Leigh B. Stoller committed
1 2 3 4 5 6
/*
 * EMULAB-COPYRIGHT
 * Copyright (c) 2000-2002 University of Utah and the Flux Group.
 * All rights reserved.
 */

7 8
/**** 
 wanlinksolve - 
Chad Barb's avatar
Chad Barb committed
9 10 11
 Resilient Overlay Network 
 Reasonably Effective Algorithm for Genetically Assigning Nodes.

12 13
 Chad Barb, May 3, 2002

Chad Barb's avatar
Chad Barb committed
14
 Applies a standard genetic algorithm (with crossover and elitism)
15 16 17 18
 to solve the problem of mapping a smaller "virtual" graph
 into a larger "physical" graph, such that the actual 
 weights between acquired nodes are similar to desired weights.

Chad Barb's avatar
Chad Barb committed
19
 The penalty function is the sum of error square roots (for the first dimension).
20 21 22 23

 For the application this was designed for,
 "weights" are values of latency time in milliseconds.

Chad Barb's avatar
Chad Barb committed
24
 switches: 
Chad Barb's avatar
Chad Barb committed
25 26
   -v     Extra verbosity
   -v -v  Jumbo verbosity 
Chad Barb's avatar
Chad Barb committed
27

Chad Barb's avatar
Chad Barb committed
28 29 30 31
   -1 <weight>
       Multiply penalty for latency by <weight>.
       (optional, default weight is 1.0)

Chad Barb's avatar
Chad Barb committed
32
   -2 <weight>
33
       Solve for 2nd (bandwidth) dimension;
Chad Barb's avatar
Chad Barb committed
34 35 36 37 38
       Penalty for error is sum of differences of natural logs,
       multiplied by <weight>.
       A good weight seems to be around 7, but the appropriate
       value is pretty much application-dependent.

Chad Barb's avatar
Chad Barb committed
39 40 41 42 43 44
   -3 <weight>
       Solve for 3rd (loss) dimension
       Penalty for error is difference of %% (10 * percent) loss,
       multiplied by <weight>.
       -2 must be specified first.

45 46 47
   -m <plexpenalty>
       Handle multiple virtual->physical mapping.
       For each vnode beyond 1 assigned to a pnode, <plexpenalty> will be assessed.
48 49 50
       Asks for 'p' lines of input, with the maximum number of virtual
       nodes allowed on a given physical node, per line (See below)

51 52 53
   -s <seed>
       Use a specific random seed.

Chad Barb's avatar
Chad Barb committed
54 55
   -r <roundswobetter>
       Specify the number of rounds to continue going without a better solution.
Chad Barb's avatar
Chad Barb committed
56 57 58 59 60
       default: DEFAULT_ROUNDS

   -R <maxrounds>
       Specify the absolute maximum number of rounds.
       default: -1 (infinite)
61 62 63 64 65 66 67

 takes input from stdin, outputs to stdout.

 input format:

 * One line containing a single number 'p'-- the number of physical nodes.
 * 'p' lines containing the name of each physical node
68 69
 ? 'p' lines containing the maximum number of virtual nodes each 
       physical node can accommodate. ('-m' switch only)
70 71 72
 * 'p' lines each containing 'p' space-delimited numbers;
       this is a P x P matrix of the _actual_ weight from pnodes to 
       pnodes. For latencies, there are zeros along the diagonal.
Chad Barb's avatar
Chad Barb committed
73
 ? 'p' lines, a P x P matrix of actual bandwidth ('-2' switch only)
Chad Barb's avatar
Chad Barb committed
74
 ? 'p' lines, a P x P matrix of actual loss ('-3' switch only)
Chad Barb's avatar
Chad Barb committed
75

76 77

 * One line containing a single number 'v'-- the number of virtual nodes.
78
 * 'v' lines containing the name of each virtual node.
Chad Barb's avatar
Chad Barb committed
79 80
       appending a space then the name of a physical node will permanently
       "fix" the mapping of this vnode to the named pnode.
81 82 83 84 85 86
 * 'v' lines each containing 'v' space delimited numbers;
       this is a V x V matrix of the _desired_ weight between vnodes.
       '-1's indicate "don't care"s.. (e.g. for the weight between two
       not-connected vnodes.) 
       If link weights are symmetrical, this matrix will be its own
       transpose (symmetric over the diagonal.)
Chad Barb's avatar
Chad Barb committed
87
 ? 'v' lines, a V x V matrix of desired bandwidth ('-2' switch only)
Chad Barb's avatar
Chad Barb committed
88
 ? 'v' lines, a V x V matrix of desired loss ('-3' switch only)
89 90 91 92

 output format:
 
 Easily inferred. Note that the perl regexp:
93
 /(\S+)\smapsTo\s(\S+)/
94
 will grab vnode to pnode mappings (in $1 and $2, respectively.)
Chad Barb's avatar
Chad Barb committed
95 96 97 98 99 100 101 102 103 104


 Some references on GA's:

 Goldberg 89
    D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA, 1989.

 Holland 75
    J. Holland. Adaptation In Natural and Artificial Systems. The University of Michigan Press, Ann Arbour, 1975.

105 106 107 108 109
 
****/

#include <stdio.h>
#include <stdlib.h>
Chad Barb's avatar
Chad Barb committed
110 111
#include <stdarg.h>
#include <unistd.h>
Chad Barb's avatar
Chad Barb committed
112
#include <assert.h>
113
#include <math.h>
114 115 116
#include <sys/types.h>
#include <sys/time.h>
#include <sys/resource.h>
117 118 119 120 121

// To keep things lightweight, 
// structures are statically sized to
// accommodate up to MAX_NODES nodes.
// These could be changed to STL vectors in the future.
122
#define MAX_NODES 32
Chad Barb's avatar
Chad Barb committed
123
#define MAX_DIMENSIONS 3
Chad Barb's avatar
Chad Barb committed
124

125 126
// default rounds to keep going without finding a better solution.
#define DEFAULT_ROUNDS 512
127 128

// The size of our "population."
Chad Barb's avatar
Chad Barb committed
129
// (number of phenotypes)
130
#define SOLUTIONS 400
131

Chad Barb's avatar
Chad Barb committed
132
// The probability a given child will mutate (out of 1000)
133 134
//#define MUTATE_PROB 40
#define MUTATE_PROB 10
135

Chad Barb's avatar
Chad Barb committed
136 137
// probability crossover will happen (out of 1000)
#define CROSSOVER_PROB 700
138 139 140 141 142 143 144 145 146 147 148 149

// A score below Epsilon means we've found a perfect solution,
// so stop immediately.
#define EPSILON 0.0001f

// lets STL it up a notch.
#include <map>
#include <string>

// BAM!
using namespace std;

Chad Barb's avatar
Chad Barb committed
150
// some code to enable when the solver wedges and we don't know why.
Chad Barb's avatar
Chad Barb committed
151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169
#ifdef DEBUG
int wedgecount;
static inline void BEGIN_LOOP() { wedgecount = 0; } 
static inline void IN_LOOP_hlp( int line ) 
{ 
  ++wedgecount;
  if (wedgecount == 66666) { 
    printf( "possibly wedged in line %i.\n", line );
    assert(false);
  }
}
#define IN_LOOP() IN_LOOP_hlp(__LINE__)
#else

#define BEGIN_LOOP()
#define IN_LOOP()

#endif

170 171
// keep track of user names for nodes.
static map< int, string > pnodeNames;
172
static map< string, int > reversePNodeNames;
173 174 175 176
static map< int, string > vnodeNames;

static int pnodes, vnodes;

Chad Barb's avatar
Chad Barb committed
177 178 179
static int pLatency[MAX_DIMENSIONS][MAX_NODES][MAX_NODES];
static int vDesiredLatency[MAX_DIMENSIONS][MAX_NODES][MAX_NODES];

180
static float plexPenalty = 0.0f;
181 182 183 184 185
static int maxplex[MAX_NODES];
static int userSpecifiedMultiplex = 0;

static int fixed[MAX_NODES];

Chad Barb's avatar
Chad Barb committed
186
static int dimensions;
Chad Barb's avatar
Chad Barb committed
187
static float d1weight, d2weight, d3weight;
Chad Barb's avatar
Chad Barb committed
188 189 190 191

static int verbose = 0;

static int minrounds, maxrounds;
192

193 194
static bool himutate = false;

195 196 197
class Solution
{
public:
Chad Barb's avatar
Chad Barb committed
198
  // the beef, as it were.
199
  int vnode_mapping[MAX_NODES];
200 201 202 203 204 205

  // Keep around a list of how many times each physical node is used
  // in this solution, rather than recomputing it each time it is needed
  // (which is often.)
  unsigned char pnode_uses[MAX_NODES];

Chad Barb's avatar
Chad Barb committed
206
  // calculated penalty
207
  float error;
Chad Barb's avatar
Chad Barb committed
208 209 210

  // probability of selecting this particular one (or any before it)
  // out of MAXINT
211
  unsigned int prob;
212 213
};

Chad Barb's avatar
Chad Barb committed
214 215 216
// the population pool.
// at any one time, one of these is the "current" pool (where the parents come from)
// and one is the "next" pool (where the children go)
217
static Solution pool[SOLUTIONS];
218
static Solution pool2[SOLUTIONS];
219

Chad Barb's avatar
Chad Barb committed
220 221
const char dimName[3][12] = { "latency", "bandwidth", "loss" };

Chad Barb's avatar
Chad Barb committed
222
// determines probabilities of selecting each solution.
223
static inline void prepick( Solution * currentPool )
224
{
225 226 227 228 229 230 231
  float totalFitness = 0.0f;
  int i;

  for (i = 0; i < SOLUTIONS; i++) {
    totalFitness += 1.0f / currentPool[i].error;
  }

232
  unsigned int probsofar = 0;
233
  for (i = 0; i < SOLUTIONS; i++) {
234 235
    probsofar += (unsigned int)(((float)0xFFFFFFFF / currentPool[i].error) / totalFitness);
    currentPool[i].prob = probsofar;
236
  }
237 238

  currentPool[SOLUTIONS - 1].prob = 0xFFFFFFFF;
239 240
}

241 242
// optimized to 1. not use fp 2. use a binary search, rather than a linear one.
// win: according to gprof, was taking 75% of the total time, now takes 17%.
243 244
static inline int pickABest( Solution * currentPool )
{
245 246 247 248 249 250 251 252 253 254 255 256 257 258 259
  unsigned int x = rand();

  int lo = 0;
  int hi = SOLUTIONS;
  int mid;

  while (1) {
    mid = (hi + lo) / 2;
    if (x <= currentPool[mid].prob) { 
      if (mid == 0 || x > currentPool[mid - 1].prob) break; 
      hi = mid; 
    } else { 
      lo = mid; 
    }
  } 
260

261 262
  return mid;
  /*
263 264
  int i = 0;
  while (1) { 
265
    if (x < currentPool[i].prob) break;
266
    i++;
267
    if (i == SOLUTIONS) { printf("Ick.\n"); i = 0; break;}
268 269
  }
  return i - 1;
270
  */
271 272
}

273

274
// uses a template to avoid massive numbers
275 276 277 278 279 280 281 282 283 284 285
// of "if" choices.. compiler should generate two versions,
// one with dump and one without.
template <bool verbose>
static inline void calcError( Solution * t )
{ 
  float err = 0.0f;

  if (verbose) {
    printf("Error listing:\n");
  }

286 287 288 289 290 291 292 293 294 295 296 297 298 299 300
  if (userSpecifiedMultiplex) {
    for (int x = 0; x < pnodes; x++) {
      if (t->pnode_uses[x] > 1) { 
	float errDelta = (float)(t->pnode_uses[x] - 1) * plexPenalty;
	if (verbose) {
	  printf("%i nodes multiplexed on physical node %s, (err [(vnodes - 1) * plexPenalty] %4.3f)\n",
		 t->pnode_uses[x],
		 pnodeNames[x].c_str(),
		 errDelta );
	}
	err += errDelta;
      }
    }
  }

301
  {
Chad Barb's avatar
Chad Barb committed
302 303 304 305 306
    for (int z = 0; z < dimensions; z++) {
      for (int x = 0; x < vnodes; x++) {
	for (int y = 0; y < vnodes; y++) {
	  int should = vDesiredLatency[z][x][y];
	  if (should != -1) {
307
	    int is     = pLatency[z][ t->vnode_mapping[x] ][ t->vnode_mapping[y] ];
308 309 310 311 312 313 314
	    if (is == -1) {
	      if (verbose) {
		printf("%s -> %s link nonexistant! Super-icky penality of 10000 assessed.\n",
		       vnodeNames[x].c_str(), vnodeNames[y].c_str() ); 
	      }
	      err += 10000.0f;
	    } else if (should != is) { 
Chad Barb's avatar
Chad Barb committed
315 316 317
	      float errDelta;

	      if (z == 0) {
Chad Barb's avatar
Chad Barb committed
318 319
		errDelta = d1weight * sqrtf((float)(abs(should - is)));
	      } else if (z == 1) {
Chad Barb's avatar
Chad Barb committed
320
		errDelta = d2weight * (float)(abs(should - is));
321
		if (should < is) { errDelta *= 0.5f; }
Chad Barb's avatar
Chad Barb committed
322 323
	      } else {
		errDelta = d3weight * (float)(abs( should - is ));
Chad Barb's avatar
Chad Barb committed
324 325 326 327
	      }

	      if (verbose) {
		if (z == 0) {
Chad Barb's avatar
Chad Barb committed
328
		  printf("%s -> %s latency (ms) should be %i; is %i (err [wt * sqrt |a-b|] %4.3f)\n", 
Chad Barb's avatar
Chad Barb committed
329 330
			 vnodeNames[x].c_str(), vnodeNames[y].c_str(), 
			 should, is, errDelta );
Chad Barb's avatar
Chad Barb committed
331
		} else if (z == 1) {
332
		  printf("%s -> %s bandwidth (kB/s) should be ~%i; is ~%i (err [wt %s* ln (a/b)] %4.3f)\n", 
Chad Barb's avatar
Chad Barb committed
333 334 335
			 vnodeNames[x].c_str(), vnodeNames[y].c_str(), 
			 (int)expf((float)should / 1000.0f), 
			 (int)expf((float)is / 1000.0f),
336
			 (should < is) ? "* 0.5 " : "",
Chad Barb's avatar
Chad Barb committed
337
			 errDelta );
Chad Barb's avatar
Chad Barb committed
338 339 340 341 342 343
		} else {
		  printf("%s -> %s loss should be %1.4f; is %1.4f (err [wt * |a-b|] %4.3f)\n",
			 vnodeNames[x].c_str(), vnodeNames[y].c_str(), 			 
			 (float)should / 65536.0f,
			 (float)is / 65536.0f,
			 errDelta );
Chad Barb's avatar
Chad Barb committed
344 345 346
		}
	      }
	      err += errDelta;
347 348 349 350 351 352 353
	    }
	  }
	}
      }
    }
  }

Chad Barb's avatar
Chad Barb committed
354
  if (verbose) { printf("error of %4.3f\n", err ); }
355 356 357 358 359 360 361 362 363 364 365 366 367
  t->error = err;
} 

static int compar( const void * a , const void * b )
{
  Solution * sa = (Solution *)a;
  Solution * sb = (Solution *)b;

  if (sa->error > sb->error) { return  1; } else
  if (sa->error < sb->error) { return -1; } else
  { return 0; }
}

368
static inline void sortByError( Solution * t )
369 370
{
  // Ahh.. sweet, sweet qsort.
371
  qsort( t, SOLUTIONS, sizeof( Solution ), compar );
372 373 374 375 376 377 378
}

// "Mutating" is swapping what vnode a pnode maps to in
// the solution with what vnode a different pnode maps to.
// (if both are -1, e.g. not mapped to vnodes, nothing happens.)
static inline void mutate( Solution * t )
{
Chad Barb's avatar
Chad Barb committed
379
  BEGIN_LOOP();
380
  while(1) {
Chad Barb's avatar
Chad Barb committed
381
    IN_LOOP();
382
    // forecast calls for a 1% chance of mutation...
383
    if ((rand() % 1000) > (himutate ? 500 : MUTATE_PROB)) { break; }
384 385 386 387
    
    if ((rand() % 3)) {
      // swap mutation. 
      int a, b;
Chad Barb's avatar
Chad Barb committed
388 389

      BEGIN_LOOP();
390
      do {
Chad Barb's avatar
Chad Barb committed
391
	IN_LOOP();
392
	a = rand() % vnodes;
Chad Barb's avatar
Chad Barb committed
393 394 395 396 397
      } while (fixed[a] != -1);

      BEGIN_LOOP();
      do {
	IN_LOOP();
398
	b = rand() % vnodes;
Chad Barb's avatar
Chad Barb committed
399 400 401 402 403 404 405
      } while (fixed[b] != -1);

      if (a != b) {
	int temp = t->vnode_mapping[a];
	t->vnode_mapping[a] = t->vnode_mapping[b];
	t->vnode_mapping[b] = temp;
      }
406 407 408 409 410
    } else {
      // reassign mutation

      int a, b;
      // find which vnode to remap
Chad Barb's avatar
Chad Barb committed
411
      BEGIN_LOOP();
412
      do {
Chad Barb's avatar
Chad Barb committed
413
	IN_LOOP();
414 415 416 417 418 419 420
	a = rand() % vnodes;
      } while (fixed[a] != -1);

      // de-map it.
      --t->pnode_uses[ t->vnode_mapping[a] ];

      // now find a suitable physical node.
Chad Barb's avatar
Chad Barb committed
421
      BEGIN_LOOP();
422
      do {
Chad Barb's avatar
Chad Barb committed
423
	IN_LOOP();
424 425 426 427 428 429 430
	b = rand() % pnodes;
      } while (t->pnode_uses[b] >= maxplex[b]);

      // now map it.
      t->vnode_mapping[a] = b;
      ++t->pnode_uses[b];
    }
431 432 433 434 435 436 437 438
  }
}

// TODO: make sure that failed matings don't happen too
// often for difficult graphs.
// (perhaps have a limited retry)
static inline void splice( Solution * t, Solution * a, Solution * b)
{
Chad Barb's avatar
Chad Barb committed
439 440 441 442 443 444 445 446 447 448 449 450 451 452 453
  if ((rand() % 1000) > CROSSOVER_PROB) {
    if (rand() % 2) {
      for (int x = 0; x < vnodes; x++) {
	t->vnode_mapping[x] = a->vnode_mapping[x];
      }
      for (int y = 0; y < vnodes; y++) {
	t->pnode_uses[y] = a->pnode_uses[y];
      }
    } else {
      for (int x = 0; x < vnodes; x++) {
	t->vnode_mapping[x] = b->vnode_mapping[x];
      }
      for (int y = 0; y < vnodes; y++) {
	t->pnode_uses[y] = b->pnode_uses[y];
      }
454
    }
Chad Barb's avatar
Chad Barb committed
455
  } else {
456

Chad Barb's avatar
Chad Barb committed
457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481
    bzero( t->pnode_uses, sizeof( t->pnode_uses ) );
    
    for (int i = 0; i < vnodes; i++) {
      if (fixed[i] != -1) {
	t->vnode_mapping[i] = fixed[i];
	++t->pnode_uses[ fixed[i] ];
      }
    }
    
    // go through each mapping, and pick randomly
    // which one of the two parents' mappings the child
    // will inherit.
    // Inherit the one that makes sense if the other would
    // conflict with a previously chosen mapping.
    // If both would conflict with a previously chosen mapping.
    // its a failed mating, and we return.
    
    int pos = rand() % vnodes;
    for (int i = 0; i < vnodes; i++) {
      pos = (pos + 1) % vnodes;
      if (fixed[pos] != -1) continue;
      if (rand() % 2) {
	if (t->pnode_uses[ a->vnode_mapping[pos] ] < maxplex[ a->vnode_mapping[pos] ]) {
	  t->vnode_mapping[pos] = a->vnode_mapping[pos];
	  ++t->pnode_uses[ a->vnode_mapping[pos] ];
482
	} else {
Chad Barb's avatar
Chad Barb committed
483 484 485 486 487 488 489 490 491 492 493 494
	  if (t->pnode_uses[ b->vnode_mapping[pos] ] < maxplex[ b->vnode_mapping[pos] ]) {
	    t->vnode_mapping[pos] = b->vnode_mapping[pos];
	    ++t->pnode_uses[ b->vnode_mapping[pos] ];
	  } else {
	    // failed mating (asexually clone a parent)
	    for (int x = 0; x < vnodes; x++) {
	      t->vnode_mapping[x] = a->vnode_mapping[x];
	    }
	    for (int y = 0; y < vnodes; y++) {
	      t->pnode_uses[y] = a->pnode_uses[y];
	    }
	    break;
495
	  }
496 497
	}
      } else {
Chad Barb's avatar
Chad Barb committed
498 499 500
	if (t->pnode_uses[ b->vnode_mapping[pos] ] < maxplex[ b->vnode_mapping[pos] ]) {
	  t->vnode_mapping[pos] = b->vnode_mapping[pos];
	  ++t->pnode_uses[ b->vnode_mapping[pos] ];
501
	} else {
Chad Barb's avatar
Chad Barb committed
502 503 504 505 506 507 508 509 510 511 512 513
	  if (t->pnode_uses[ a->vnode_mapping[pos] ] < maxplex[ a->vnode_mapping[pos] ]) {
	    t->vnode_mapping[pos] = a->vnode_mapping[pos];
	    ++t->pnode_uses[ a->vnode_mapping[pos] ];
	  } else {
	    // failed mating (asexually clone a parent)
	    for (int x = 0; x < vnodes; x++) {
	      t->vnode_mapping[x] = b->vnode_mapping[x];
	    }
	    for (int y = 0; y < vnodes; y++) {
	      t->pnode_uses[y] = b->pnode_uses[y];
	    }
	    break;
514
	  }
515 516 517 518 519 520 521 522 523 524 525 526 527
	}
      }
    }
  }

  mutate( t );
  calcError<false>( t );  
} 

// Generate a random solution 
// for the initial population.
static inline void generateRandomSolution( Solution * t )
{
528 529
  //int pnode_uses[MAX_NODES];
  bzero( t->pnode_uses, sizeof( t->pnode_uses ) );
530 531 532 533

  for (int i = 0; i < vnodes; i++) {
    if (fixed[i] != -1) {
      t->vnode_mapping[i] = fixed[i];
534
      ++t->pnode_uses[ fixed[i] ];
535 536
    }
  }
537 538 539 540

  for (int i = 0; i < vnodes; i++) {
    if (fixed[i] == -1) {
      int x;
Chad Barb's avatar
Chad Barb committed
541
      BEGIN_LOOP();
542
      do {
Chad Barb's avatar
Chad Barb committed
543
	IN_LOOP();
544
	x = rand() % pnodes;
545 546
      } while( t->pnode_uses[x] >= maxplex[x] );
      ++t->pnode_uses[x];
547 548 549 550
      t->vnode_mapping[i] = x;
    }
  }

551 552 553
  calcError<false>( t );
}

Chad Barb's avatar
Chad Barb committed
554
void usage( char * appname )
555
{
Chad Barb's avatar
Chad Barb committed
556 557
  fprintf(stderr,
	  "Usage:\n"
Chad Barb's avatar
Chad Barb committed
558 559
	  "%s [-v [-v]] [-m <penalty>] [-s <seed>] [-1 <weight>]\n"
	  "\t[-2 <weight> [-3 <weight>]] [-r <minrounds>] [-R <maxrounds>]\n\n"
Chad Barb's avatar
Chad Barb committed
560
	  "  -v              extra verbosity\n"
Chad Barb's avatar
Chad Barb committed
561
	  "  -v -v           jumbo verbosity\n"
562 563
	  "  -m <penalty>    enable many-to-one virtual to physical mappings\n"
	  "  -s <seed>       seed the random number generator with a specific value\n"
Chad Barb's avatar
Chad Barb committed
564
	  "  -1 <weight>     assign weight to latency penalty (optional; default 1.0)\n"
Chad Barb's avatar
Chad Barb committed
565 566
	  "  -2 <weight>     enable solving for bandwidth;\n"
	  "                  multiply bandwidth penalties by <weight>.\n"
Chad Barb's avatar
Chad Barb committed
567 568
	  "  -3 <weight>     enable solving for loss.\n"
	  "                  (must specify -2 first)\n"
Chad Barb's avatar
Chad Barb committed
569
	  "  -r <minrounds>  number of rounds to go without a solution before stopping\n"
Chad Barb's avatar
Chad Barb committed
570 571 572
	  "                  default: %i\n"
	  "  -R <maxrounds>  set maximum rounds\n"
	  "                  default: infinite (-1)\n\n", appname, DEFAULT_ROUNDS );
Chad Barb's avatar
Chad Barb committed
573
  exit(1);
Chad Barb's avatar
Chad Barb committed
574 575
}

576 577 578 579 580 581 582 583 584 585
unsigned int msecscpu()
{
  struct rusage r;

  getrusage( 0, &r );

  return r.ru_utime.tv_sec * 1000 + 
         r.ru_utime.tv_usec / 1000;
}

Chad Barb's avatar
Chad Barb committed
586 587
int main( int argc, char ** argv )
{
Chad Barb's avatar
Chad Barb committed
588
  unsigned int seed = 1;
Chad Barb's avatar
Chad Barb committed
589 590
  int available = 0;
  int fixedNodeCount = 0;
591
  unsigned int bestSpeed = 0;
Chad Barb's avatar
Chad Barb committed
592

Chad Barb's avatar
Chad Barb committed
593 594
  verbose = 0;
  dimensions = 1;
Chad Barb's avatar
Chad Barb committed
595
  d1weight = 1.0f;
Chad Barb's avatar
Chad Barb committed
596
  d2weight = 1.0f / 1000.0f;
Chad Barb's avatar
Chad Barb committed
597
  d3weight = 1.0f / 65536.0f;
Chad Barb's avatar
Chad Barb committed
598 599 600 601 602 603

  minrounds = DEFAULT_ROUNDS;
  maxrounds = -1;

  int ch;

Chad Barb's avatar
Chad Barb committed
604 605 606 607 608 609 610
  { 
    struct timeval tp;
    if ( 0 == gettimeofday( &tp, NULL )) {
      seed = ((unsigned int)tp.tv_sec << 6) + (unsigned int)tp.tv_usec;
    }
  }

Chad Barb's avatar
Chad Barb committed
611
  while ((ch = getopt(argc, argv, "v1:2:3:r:R:s:m:")) != -1) {
Chad Barb's avatar
Chad Barb committed
612
    switch (ch) {
613
    case 's':
Chad Barb's avatar
Chad Barb committed
614
      seed = atoi( optarg );
615
      break;
Chad Barb's avatar
Chad Barb committed
616 617 618
    case 'v': 
      verbose++; 
      break;
619
    case 'm':
620
      plexPenalty = atof( optarg );
621 622
      userSpecifiedMultiplex++;
      break;
Chad Barb's avatar
Chad Barb committed
623 624 625
    case '1':
      d1weight = atof( optarg );
      break;
Chad Barb's avatar
Chad Barb committed
626 627 628 629
    case '2': 
      dimensions = 2;
      d2weight = atof( optarg ) / 1000.0f; 
      break;
Chad Barb's avatar
Chad Barb committed
630 631 632 633 634 635 636 637 638
    case '3':
      if (dimensions != 2) {
	fprintf(stderr, "Must specify -2 option first when using -3.\n");
	exit(1);
      } else {
	dimensions = 3;
	d3weight = atof( optarg ) / 65536.0f;
      }
      break;
Chad Barb's avatar
Chad Barb committed
639 640 641 642 643 644 645 646
    case 'r':
      minrounds = atoi( optarg );
      break;
    case 'R':
      maxrounds = atoi( optarg );
      break;
    default: 
      usage( argv[0] );
Chad Barb's avatar
Chad Barb committed
647
      break;
Chad Barb's avatar
Chad Barb committed
648 649 650
    }
  }

651 652 653 654 655 656 657 658 659 660
  if (minrounds < 0 ) { minrounds = 0; }
  if (maxrounds < 0 ) { maxrounds = -1; }

  if (d1weight < 0.0f || d2weight < 0.0f || d3weight < 0.0f /* || plexPenalty < 0.0f */) {
    fprintf(stderr, 
	    "The '-1','-2' and '-3' switches each require\n"
	    "a positive argument, or zero.\n"
	    "Negative weights are silly.\n" );
    exit(1);
  }
Chad Barb's avatar
Chad Barb committed
661

Chad Barb's avatar
Chad Barb committed
662 663 664
  srand( seed );
  if (verbose) { printf("Using random seed %u\n", seed ); }

665
  char line[4096];
666 667

  {
Chad Barb's avatar
Chad Barb committed
668
    if (verbose > 1) { printf("How many physical nodes?\n"); }
Chad Barb's avatar
Chad Barb committed
669
    fgets( line, sizeof( line ), stdin );
670 671
    sscanf( line, "%i", &pnodes );

Chad Barb's avatar
Chad Barb committed
672
    if (verbose > 1) { printf("Okay, enter %i names for the physical nodes, one per line.\n", pnodes ); }
673 674
    for (int i = 0; i < pnodes; i++) {
      char name[1024];
Chad Barb's avatar
Chad Barb committed
675
      fgets( line, sizeof( line ), stdin );
676 677
      sscanf( line, "%s", name );
      pnodeNames[i] = string( name );
678 679 680 681
      reversePNodeNames[string(name)] = i;
    }

    if (userSpecifiedMultiplex) {
Chad Barb's avatar
Chad Barb committed
682
      if (verbose > 1) { printf("Enter %i numbers, one per line, indicating the"
683 684 685
			    " maximum number of virtual nodes allowed on each"
			    " physical node.\n", pnodes ); }
      for (int i = 0; i < pnodes; i++) {
Chad Barb's avatar
Chad Barb committed
686
	fgets( line, sizeof( line ), stdin );
687
	sscanf( line, "%i", &(maxplex[i]));
Chad Barb's avatar
Chad Barb committed
688
	available += maxplex[i];
689 690 691 692
      }
    } else {
      for (int i = 0; i < pnodes; i++) {
	maxplex[i] = 1;
Chad Barb's avatar
Chad Barb committed
693
	++available;
694
      }
695 696
    }

Chad Barb's avatar
Chad Barb committed
697
    for (int z = 0; z < dimensions; z++) {
Chad Barb's avatar
Chad Barb committed
698
      if (verbose > 1) {
Chad Barb's avatar
Chad Barb committed
699
	printf("Enter %ix%i grid o' actual %s.\n", pnodes, pnodes, dimName[z]);
Chad Barb's avatar
Chad Barb committed
700 701 702
      }
      for (int y = 0; y < pnodes; y++) {
	char * linePos = line;
Chad Barb's avatar
Chad Barb committed
703
	fgets( line, sizeof( line ), stdin );
Chad Barb's avatar
Chad Barb committed
704 705
	while (*linePos == ' ') { linePos++; } // skip leading whitespace
	for (int x = 0; x < pnodes; x++) {
Chad Barb's avatar
Chad Barb committed
706
	  float temp;
Chad Barb's avatar
Chad Barb committed
707
	  sscanf( linePos, "%i", &pLatency[z][x][y] );
Chad Barb's avatar
Chad Barb committed
708
	  sscanf( linePos, "%f", &temp );
709
	    if (pLatency[z][x][y] != -1) {
Chad Barb's avatar
Chad Barb committed
710 711 712 713 714
	      if (z == 1) { 
		pLatency[z][x][y] = (int)( logf(pLatency[z][x][y]) * 1000.0f ); 
	      } else if (z == 2) {
		pLatency[z][x][y] = (int)(temp * 65536.0f);
	      }
715
	  }
Chad Barb's avatar
Chad Barb committed
716 717 718
	  while (*linePos != ' ' && *linePos != '\n') { linePos++; }
	  while (*linePos == ' ') { linePos++; }
	}
719 720 721 722 723
      }
    }
  } 

  {
Chad Barb's avatar
Chad Barb committed
724
    if (verbose > 1) { printf("How many virtual nodes?\n"); }
Chad Barb's avatar
Chad Barb committed
725
    fgets( line, sizeof( line ), stdin );
726 727
    sscanf( line, "%i", &vnodes );

Chad Barb's avatar
Chad Barb committed
728 729 730 731 732 733 734 735 736 737 738
    if (vnodes > available) {
      fprintf(stderr, 
	      "More nodes required (%i) than can be mapped (%i).\n", 
	      vnodes, available );
      exit(2);
    }

    if (verbose > 1) { printf("Okay, enter %i names for the virtual nodes, one per line.\n"
			      "to fix a node, suffix a space then the name of the physical node.\n", 
			      vnodes ); }

739 740
    for (int i = 0; i < vnodes; i++) {
      char name[1024];
Chad Barb's avatar
Chad Barb committed
741
      char pname[1024];
Chad Barb's avatar
Chad Barb committed
742
      fgets( line, sizeof( line ), stdin );
Chad Barb's avatar
Chad Barb committed
743 744
      if (sscanf( line, "%s %s", name, pname ) == 2) {
	map< string, int >::iterator it = reversePNodeNames.find( string( pname ) );
745
	if (it == reversePNodeNames.end()) {
Chad Barb's avatar
Chad Barb committed
746 747
	  fprintf(stderr,"pnode '%s' does not exist; can't fix.\n", pname );
	  exit(3);
748
	}
Chad Barb's avatar
Chad Barb committed
749 750
	if (verbose > 1) { 
	  printf("Fixing assignment from vnode %s to pnode %s.\n", name, pname );
751
	}
Chad Barb's avatar
Chad Barb committed
752 753
	fixed[i] = reversePNodeNames[ string( pname ) ];
	fixedNodeCount++;
754 755 756
      } else {
	fixed[i] = -1;
      }
Chad Barb's avatar
Chad Barb committed
757
      vnodeNames[i] = string( name );
758 759
    }

Chad Barb's avatar
Chad Barb committed
760
    for (int z = 0; z < dimensions; z++) {
Chad Barb's avatar
Chad Barb committed
761
      if (verbose > 1) {
Chad Barb's avatar
Chad Barb committed
762
	printf("Enter %ix%i grid o' desired %s (-1 is don't care.)\n", vnodes, vnodes, 
Chad Barb's avatar
Chad Barb committed
763
	       dimName[z]);
764
      }
Chad Barb's avatar
Chad Barb committed
765 766
      for (int y = 0; y < vnodes; y++) {
	char * linePos = line;
Chad Barb's avatar
Chad Barb committed
767
	fgets( line, sizeof( line ), stdin );
Chad Barb's avatar
Chad Barb committed
768 769
	while (*linePos == ' ') { linePos++; } // skip leading whitespace
	for (int x = 0; x < vnodes; x++) {
Chad Barb's avatar
Chad Barb committed
770
	  float temp;
Chad Barb's avatar
Chad Barb committed
771
	  sscanf( linePos, "%i", &vDesiredLatency[z][x][y] );
Chad Barb's avatar
Chad Barb committed
772 773 774
	  sscanf( linePos, "%f", &temp );
	  if (vDesiredLatency[z][x][y] != -1) {
	    if (z == 1) { 
Chad Barb's avatar
Chad Barb committed
775
	      vDesiredLatency[z][x][y] = (int)(logf(vDesiredLatency[z][x][y]) * 1000.0f); 
Chad Barb's avatar
Chad Barb committed
776 777
	    } else if (z == 2) {
	      vDesiredLatency[z][x][y] = (int)(temp * 65536.0f);
Chad Barb's avatar
Chad Barb committed
778 779 780 781 782 783 784 785
	    }
	  }
	  while (*linePos != ' ' && *linePos != '\n') { linePos++; }
	  while (*linePos == ' ') { linePos++; }
	}
      }
    } 
  }
786

787 788 789
  Solution * currentPool = pool;
  Solution * nextPool = pool2;

Chad Barb's avatar
Chad Barb committed
790 791
  if (fixedNodeCount < vnodes) {
    if (verbose) { printf("Now running...\n"); }
792

Chad Barb's avatar
Chad Barb committed
793 794
    {
      for (int i = 0; i < SOLUTIONS; i++) {
795
	generateRandomSolution( &(currentPool[i]) );
Chad Barb's avatar
Chad Barb committed
796
      }
797
      sortByError( currentPool );
798 799 800
    }

    int highestFoundRound = 0;
801 802
    float last = currentPool[0].error;

803
    himutate = false;
Chad Barb's avatar
Chad Barb committed
804
    for (int i = 0; i != maxrounds && i < (highestFoundRound + minrounds); i++) {
805 806 807 808 809 810 811 812 813 814 815 816
     
      float avg = 0.0f;
      int xy;
      for (xy = 0; xy < SOLUTIONS; xy++) { avg += currentPool[xy].error; }
      avg /= (float)SOLUTIONS;
      
      float stddev = 0.0f;
      for (xy = 0; xy < SOLUTIONS; xy++) { 
	float diff = currentPool[xy].error - avg;
	stddev += diff * diff;
      }
      stddev = sqrtf(stddev / (float)(SOLUTIONS - 1));
817
      
818
      if (verbose && !(i % 100)) {
819
	printf("Round %i. (best %4.3f; avg %4.3f; sdev %4.3f)\n", i, currentPool[0].error, avg, stddev);
820
      }
Chad Barb's avatar
Chad Barb committed
821
      
822
      if (currentPool[0].error < last) {
Chad Barb's avatar
Chad Barb committed
823 824
	if (verbose) {
	  printf("Better solution found in round %i (error %4.3f)\n", 
825
		 i, currentPool[0].error);
Chad Barb's avatar
Chad Barb committed
826
	}
827
	bestSpeed = msecscpu();
828
	last = currentPool[0].error;
829 830
	highestFoundRound = i;
      }
831

Chad Barb's avatar
Chad Barb committed
832 833
      // this is "elitism" -- the best solution is guaranteed to survive.
      // (otherwise, a good solution may be found, but may be lost by the next generation.)
834 835 836 837 838
      memcpy( &(nextPool[0]), &(currentPool[0]), sizeof( Solution ) );
      prepick( currentPool );

      int j;

839 840 841 842 843 844
      // if there is not enough variety, more mutation!
      if (stddev < (avg / 10.0f)) { 
	himutate = true;
      }

      for (j = 1; j < SOLUTIONS; j++) {
845 846 847 848 849
	splice( &(nextPool[j]),
		&(currentPool[pickABest( currentPool )]),
		&(currentPool[pickABest( currentPool )]) );
      }

Chad Barb's avatar
Chad Barb committed
850 851 852
      //if (stddev < (avg / 10.0f))) {
      himutate = false;
      //}
Chad Barb's avatar
Chad Barb committed
853

854 855 856 857 858 859 860
      sortByError( nextPool );

      Solution * temp = currentPool;
      currentPool = nextPool;
      nextPool = temp;

      if (currentPool[0].error < EPSILON) { 
Chad Barb's avatar
Chad Barb committed
861
	if (verbose > 1) { printf("Found perfect solution.\n"); }
862 863 864
	break;
      }
    }
Chad Barb's avatar
Chad Barb committed
865 866
  } else {
    if (verbose) { printf("No non-fixed vnodes (or no vnodes at all,) so nothing to be done!\n"); }
867 868 869
  }

  {
Chad Barb's avatar
Chad Barb committed
870
    if (verbose) { printf("\nYour solution is as follows:\n"); }
871
    for (int x = 0; x < vnodes; x++) {
872 873
      if (pnodeNames.find( currentPool[0].vnode_mapping[x] ) == pnodeNames.end()) {
	pnodeNames[ currentPool[0].vnode_mapping[x] ] = "CRAP";
Chad Barb's avatar
Chad Barb committed
874 875 876
      }
      printf("%s mapsTo %s\n", 
	     vnodeNames[x].c_str(),
877
	     pnodeNames[currentPool[0].vnode_mapping[x]].c_str() );
878
    }
879

880 881 882
    printf("\n");

    // dump a detailed report of the returned solution's errors.
883 884
    if (verbose > 1) { 
      calcError<true>( &(currentPool[0]) ); 
Chad Barb's avatar
Chad Barb committed
885
      printf("Found in %i msecs (cpu time)\n", bestSpeed );
886
    }
887 888
  }

Chad Barb's avatar
Chad Barb committed
889
  if (verbose > 1) { printf("Bye now.\n"); }
890 891
  return 0;
}