assign.cc 18.5 KB
Newer Older
Robert Ricci's avatar
Robert Ricci committed
1 2 3 4 5 6
/*
 * EMULAB-COPYRIGHT
 * Copyright (c) 2000-2003 University of Utah and the Flux Group.
 * All rights reserved.
 */

7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
#include "port.h"

#include <hash_map>
#include <rope>
#include <queue>

#include <boost/config.hpp>
#include <boost/utility.hpp>
#include <boost/property_map.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/dijkstra_shortest_paths.hpp>
#include <boost/graph/graphviz.hpp>

#include <fstream.h>
Mac Newbold's avatar
Mac Newbold committed
22
#include <iostream.h>
23
#include <time.h>
Mac Newbold's avatar
Mac Newbold committed
24
#include <stdlib.h>
25
#include <math.h>
Mac Newbold's avatar
Mac Newbold committed
26 27
#include <sys/types.h>
#include <sys/time.h>
28 29 30
#include <sys/resource.h>

using namespace boost;
Mac Newbold's avatar
Mac Newbold committed
31 32

#include "common.h"
33
#include "delay.h"
Mac Newbold's avatar
Mac Newbold committed
34
#include "physical.h"
35
#include "virtual.h"
36
#include "vclass.h"
37
#include "pclass.h"
38
#include "score.h"
39 40 41
#include "solution.h"
#include "maps.h"
#include "anneal.h"
42 43 44

// Here we set up all our graphs.  Need to create the graphs
// themselves and then setup the property maps.
45
tb_pgraph PG;
46 47 48 49 50 51 52 53 54 55
tb_pgraph_vertex_pmap pvertex_pmap = get(vertex_data, PG);
tb_pgraph_edge_pmap pedge_pmap = get(edge_data, PG);
tb_sgraph SG;
tb_sgraph_vertex_pmap svertex_pmap = get(vertex_data, SG);
tb_sgraph_edge_pmap sedge_pmap = get(edge_data, SG);
tb_vgraph VG;
tb_vgraph_vertex_pmap vvertex_pmap = get(vertex_data, VG);
tb_vgraph_edge_pmap vedge_pmap = get(edge_data, VG);

// A simple list of physical types.
56
name_count_map ptypes;
57 58

// List of virtual types by name.
59
name_count_map vtypes;
60 61

// A list of all pclasses.
62
pclass_list pclasses;
63 64 65
 	
// Map from a pnode* to the the corresponding pvertex.
pnode_pvertex_map pnode2vertex;
66 67 68

// Map of a type to a tt_entry, a vector of pclasses and the size of
// the vector.
69
pclass_types type_table;
70 71 72
#ifdef PER_VNODE_TT
pclass_types vnode_type_table;
#endif
73

74 75 76 77 78
// This datastructure contains all the information needed to calculate
// the shortest path between any two switches.  Indexed by svertex,
// the value will be a predicate map (indexed by svertex as well) of
// the shortest paths for the given vertex.
switch_pred_map_map switch_preds;
79

80 81
// Same, but for distances 
switch_dist_map_map switch_dist;
Christopher Alfeld's avatar
 
Christopher Alfeld committed
82

83 84
// Time started, finished, and the time limit
double timestart, timeend, timelimit, timetarget;
85

86 87 88
// An amount to scale the neighborhood size by
double scale_neighborhood = 1.0;

89 90 91 92 93
#ifdef GNUPLOT_OUTPUT
FILE *scoresout, *tempout, *deltaout;
#endif
// Whether or not assign is allowed to generate trivial links
bool allow_trivial_links = true;
94

95
// Whether or not assign should use pclasses
96
bool disable_pclasses = false;
97

Robert Ricci's avatar
Robert Ricci committed
98 99 100
// Whether or not assign should prune out pclasses that it knows can
// never be used
bool prune_pclasses = false;
101 102 103

// Whether or not we should use the experimental support for dynamic pclasses
bool dynamic_pclasses = false;
104 105 106 107
  
// XXX - shouldn't be in this file
double absbest;
int absbestviolated, iters, iters_to_best;
Robert Ricci's avatar
Robert Ricci committed
108

109 110 111
/*
 * Internal functions
 */
Mac Newbold's avatar
Mac Newbold committed
112

Robert Ricci's avatar
Robert Ricci committed
113
// Return the CPU time (in seconds) used by this process
114 115 116 117 118 119 120 121
float used_time()
{
  struct rusage ru;
  getrusage(RUSAGE_SELF,&ru);
  return ru.ru_utime.tv_sec+ru.ru_utime.tv_usec/1000000.0+
    ru.ru_stime.tv_sec+ru.ru_stime.tv_usec/1000000.0;
}

Robert Ricci's avatar
Robert Ricci committed
122
// Read in the .ptop file
123 124 125 126
void read_physical_topology(char *filename)
{
  ifstream ptopfile;
  ptopfile.open(filename);
Robert Ricci's avatar
Robert Ricci committed
127 128 129 130
  if (!ptopfile.is_open()) {
      cerr << "Unable to open ptop file " << filename << endl;
      exit(2);
  }
131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153
  cout << "Physical Graph: " << parse_ptop(PG,SG,ptopfile) << endl;

#ifdef DUMP_GRAPH
  {
    cout << "Physical Graph:" << endl;
    
    pvertex_iterator vit,vendit;
    tie(vit,vendit) = vertices(PG);
    
    for (;vit != vendit;vit++) {
      tb_pnode *p = get(pvertex_pmap,*vit);
      cout << *vit << "\t" << *p;
    }
    
    pedge_iterator eit,eendit;
    tie(eit,eendit) = edges(PG);

    for (;eit != eendit;eit++) {
      tb_plink *p = get(pedge_pmap,*eit);
      cout << *eit << " (" << source(*eit,PG) << " <-> " <<
	target(*eit,PG) << ")\t" << *p;
    }
  }
Robert Ricci's avatar
Robert Ricci committed
154
#endif // DUMP_GRAPH
155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177

#ifdef GRAPH_DEBUG
  {
    cout << "Switch Graph:" << endl;
    

    svertex_iterator vit,vendit;
    tie(vit,vendit) = vertices(SG);
    
    for (;vit != vendit;vit++) {
      tb_switch *p = get(svertex_pmap,*vit);
      cout << *vit << "\t" << *p;
    }
    
    sedge_iterator eit,eendit;
    tie(eit,eendit) = edges(SG);

    for (;eit != eendit;eit++) {
      tb_slink *p = get(sedge_pmap,*eit);
      cout << *eit << " (" << source(*eit,SG) << " <-> " <<
	target(*eit,SG) << ")\t" << *p;
    }
  }
Robert Ricci's avatar
Robert Ricci committed
178
#endif // GRAPH_DEBUG
179

Robert Ricci's avatar
Robert Ricci committed
180 181
  // Set up pnode2vertex - a mapping between vertices in the physical graph and
  // the pnodes that we just read in from the ptop file
182 183 184 185 186 187 188 189
  pvertex_iterator pvit,pvendit;
  tie(pvit,pvendit) = vertices(PG);
  for (;pvit != pvendit;pvit++) {
    pnode2vertex[get(pvertex_pmap,*pvit)]=*pvit;
  }

}

Robert Ricci's avatar
Robert Ricci committed
190 191
// Calculate the minimum spanning tree for the switches - we only consider one
// potential path between each pair of switches.
192
void calculate_switch_MST()
Christopher Alfeld's avatar
 
Christopher Alfeld committed
193
{
194
  cout << "Calculating shortest paths on switch fabric." << endl;
Robert Ricci's avatar
Robert Ricci committed
195 196

  // Set up the weight map for Dijkstra's
197 198 199 200 201 202 203 204 205 206
  tb_sgraph_weight_pmap sweight_pmap = get(edge_weight, SG);
  sedge_iterator seit,seendit;
  tie(seit,seendit) = edges(SG);
  for (;seit != seendit;seit++) {
    tb_slink *slink = get(sedge_pmap,*seit);
    // XXX should we make this more complicated depending on
    // latency/loss as well?
    put(sweight_pmap,*seit,
	100000000-get(pedge_pmap,slink->mate)->delay_info.bandwidth);
  }
Christopher Alfeld's avatar
 
Christopher Alfeld committed
207

Robert Ricci's avatar
Robert Ricci committed
208
  // Let boost do the Disjktra's for us, from each switch
209 210 211 212 213 214 215 216
  svertex_iterator svit,svendit;
  tie(svit,svendit) = vertices(SG);
  for (;svit != svendit;svit++) {
    switch_preds[*svit] = new switch_pred_map(num_vertices(SG));
    switch_dist[*svit] = new switch_dist_map(num_vertices(SG));
    dijkstra_shortest_paths(SG,*svit,
    			    predecessor_map(&((*switch_preds[*svit])[0])).
			    distance_map(&((*switch_dist[*svit])[0])));
Christopher Alfeld's avatar
 
Christopher Alfeld committed
217 218
  }

219 220 221 222 223 224 225 226 227
#ifdef GRAPH_DEBUG
  cout << "Shortest paths" << endl;
  tie(svit,svendit) = vertices(SG);
  for (;svit != svendit;svit++) {
    cout << *svit << ":" << endl;
    for (unsigned int i = 0;i<num_vertices(SG);++i) {
      cout << i << " " << (*switch_dist[*svit])[i] << endl;
    }
  }
Robert Ricci's avatar
Robert Ricci committed
228
#endif // GRAPH_DEBUG
229 230
}

Robert Ricci's avatar
Robert Ricci committed
231
// Read in the .top file
232 233 234 235
void read_virtual_topology(char *filename)
{
  ifstream topfile;
  topfile.open(filename);
Robert Ricci's avatar
Robert Ricci committed
236 237 238 239
  if (!topfile.is_open()) {
      cerr << "Unable to open top file " << filename << endl;
      exit(2);
  }
240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265
  cout << "Virtual Graph: " << parse_top(VG,topfile) << endl;

#ifdef DUMP_GRAPH
  {
    cout << "Virtual Graph:" << endl;
    

    vvertex_iterator vit,vendit;
    tie(vit,vendit) = vertices(VG);
    
    for (;vit != vendit;vit++) {
      tb_vnode *p = get(vvertex_pmap,*vit);
      cout << *vit << "\t" << *p;
    }
    
    vedge_iterator eit,eendit;
    tie(eit,eendit) = edges(VG);

    for (;eit != eendit;eit++) {
      tb_vlink *p = get(vedge_pmap,*eit);
      cout << *eit << " (" << source(*eit,VG) << " <-> " <<
	target(*eit,VG) << ")\t" << *p;
    }
  }  
#endif
}
Robert Ricci's avatar
Robert Ricci committed
266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291
/*
 * Make a pass through the pclasses, looking for ones that no node can use, and
 * nuking them.
 */
void prune_unusable_pclasses() {
    cout << "Pruning pclasses." << endl;
    int pruned = 0;
    pclass_list::iterator pclass_iterator = pclasses.begin();
    while (pclass_iterator != pclasses.end()) {
	if ((*pclass_iterator)->refcount == 0) {
	    pclass_list::iterator nukeme = pclass_iterator;
	    pclass_iterator++;
#ifdef PCLASS_DEBUG
	    cout << "Pruning " << (*nukeme)->name << endl;
#endif
	    pruned++;
	    delete *nukeme;
	    pclasses.erase(nukeme);
	} else {
	    pclass_iterator++;
	}
    }
    cout << "pclass pruning complete: removed " << pruned << " pclasses, " <<
	pclasses.size() << " remain." << endl;
}

292
void print_help()
293
{
294 295 296 297
  cerr << "assign [options] ptopfile topfile [config params]" << endl;
  cerr << "Options: " << endl;
#ifdef TIME_TERMINATE
  cerr << "  -l <time>   - Limit runtime." << endl;
Mac Newbold's avatar
Mac Newbold committed
298
#endif
299 300 301 302 303
  cerr << "  -s <seed>   - Set the seed." << endl;
  cerr << "  -v <viz>    - Produce graphviz files with given prefix." <<
    endl;
  cerr << "  -r          - Don't allow trivial links." << endl;
  cerr << "  -p          - Disable pclasses." << endl;
304
  cerr << "  -d          - Enable dynamic pclasses." << endl;
305 306
#ifdef PER_VNODE_TT
  cerr << "  -P          - Prune unusable pclasses." << endl;
307
#endif
308
  cerr << "  -T          - Doing some scoring self-testing." << endl;
309
  cerr << "  -H <float>  - Try <float> times harder." << endl;
310 311 312 313 314 315 316 317
  exit(2);
}
 
// Perfrom a pre-cehck to make sure that there are enough free nodes of the
// proper types. Returns 1 if the proper types exist, 0 if they do not.
// TODO - move away from using global variables
int type_precheck() {
    cout << "Type precheck:" << endl;
318

319
    bool ok = true;
Mac Newbold's avatar
Mac Newbold committed
320

321 322 323 324 325 326
    for (name_count_map::iterator vtype_it=vtypes.begin();
	    vtype_it != vtypes.end();++vtype_it) {
    
	// Check to see if there were any pnodes of the type at all
	name_count_map::iterator ptype_it = ptypes.find(vtype_it->first);
	if (ptype_it == ptypes.end()) {
327
	    cout << "  *** No physical nodes of type " << vtype_it->first
328 329
		<< " found" << endl;
	    ok = false;
330
	} else {
331 332
	    // Okay, there are some - are there enough?
	    if (ptype_it->second < vtype_it->second) {
333
		cout << "  *** " << vtype_it->second << " nodes of type " <<
334 335 336 337
		    vtype_it->first << " requested, but only "
		    << ptype_it->second << " found" << endl;
		ok = false;
	    }
338
	}
339 340 341 342 343 344 345 346 347
    }
    if (ok) {
      cout << "Type preecheck passed." << endl;
      return 1;
    } else {
      cout << "Type precheck failed!" << endl;
      return 0;
    }
}
348

349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364
// Perfrom a pre-cehck to make sure that every vnode has at least one possible
// mapping.  Returns 1 if this is the case, 0 if not.
// TODO - move away from using global variables
int mapping_precheck() {
#ifdef PER_VNODE_TT
    cout << "Node mapping precheck:" << endl;
    /*
     * Build up an entry in the type table for each vnode, by first looking at
     * the type table entry for the vnode's type, then checking each entry to
     * make sure that it:
     * (1) Has enough interfaces
     * (2) Has enough total bandwidth (for emulated links)
     * (3) Meets any 1.0-weight features and/or desires
     */
    vvertex_iterator vit,vendit;
    tie(vit,vendit) = vertices(VG);
365

366 367 368 369
    /*
     * Indicates whether all nodes have potential matches or not
     */
    bool ok = true;
370

371 372
    for (;vit != vendit;vit++) {
	tb_vnode *v = get(vvertex_pmap,*vit);
373

374 375 376 377 378 379 380 381 382 383 384 385 386 387 388
	pclass_vector *vec = new pclass_vector();
	vnode_type_table[v->name] = tt_entry(0,vec);

	// This constitutes a list of the number of ptypes that matched the
	// criteria. We use to guess what's wrong with the vnode.
	int matched_links = 0;
	int matched_bw = 0;
	// Keep track of desires had how many 'hits', so that we can tell
	// if any simply were not matched
	tb_vnode::desires_count_map matched_desires;

	tb_vclass *vclass = v->vclass;
	tb_vclass::members_map::iterator mit;
	if (vclass) {
	    mit = vclass->members.begin();
389
	}
390 391 392 393 394 395 396 397 398
	for (;;) {
	    // Loop over all types this node can take on, which might be only
	    // one, if it's not part of a vclass
	    crope this_type;
	    if (vclass) {
		this_type = mit->first;
	    } else {
		this_type = v->type;
	    }
399

400 401
	    for (pclass_vector::iterator it = type_table[this_type].second->begin();
		    it != type_table[this_type].second->end(); it++) {
402

403 404 405
		bool potential_match = true;
		// Grab the first node of the pclass as a representative sample
		tb_pnode *pnode = *((*it)->members[this_type]->L.begin());
Mac Newbold's avatar
Mac Newbold committed
406

407 408 409 410 411 412
		// Check the number of interfaces - if the pnode is a switch,
		// for now, we don't check this, since it can end up with more
		// 'interfaces' due to the fact that it can have interswitch
		// links
		if ((pnode->total_interfaces >= v->num_links) ||
			pnode->current_type.compare("switch")) {
413 414 415 416
		    matched_links++;
		} else {
		    potential_match = false;
		}
Mac Newbold's avatar
Mac Newbold committed
417

418 419 420 421 422 423
		// Check bandwidth on emulated links
		if (pnode->total_bandwidth >= v->total_bandwidth) {
		    matched_bw++;
		} else {
		    potential_match = false;
		}
Mac Newbold's avatar
Mac Newbold committed
424

425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449
		//
		// Check features and desires
		//

		// Desires first
		for (tb_vnode::desires_map::iterator desire_it = v->desires.begin();
			desire_it != v->desires.end();
			desire_it++) {
		    crope name = (*desire_it).first;
		    float value = (*desire_it).second;
		    // Only check for desires that would result in a violation if
		    // unsatisfied
		    if (value >= FD_VIOLATION_WEIGHT) {
			if (matched_desires.find(name) == matched_desires.end()) {
			    matched_desires[name] = 0;
			}
			tb_pnode::features_map::iterator feature_it =
			    pnode->features.find(name);
			if (feature_it != pnode->features.end()) {
			    matched_desires[name]++;
			} else {
			    potential_match = false;
			}
		    }
		}
Mac Newbold's avatar
Mac Newbold committed
450

451 452 453 454 455 456 457 458 459 460 461 462 463 464 465
		// Next, features
		for (tb_pnode::features_map::iterator feature_it = pnode->features.begin();
			feature_it != pnode->features.end(); feature_it++) {
		    crope name = (*feature_it).first;
		    float value = (*feature_it).second;
		    // Only check for feature that would result in a violation if
		    // undesired
		    if (value >= FD_VIOLATION_WEIGHT) {
			tb_vnode::desires_map::iterator desire_it =
			    v->desires.find(name);
			if (desire_it == v->desires.end()) {
			    potential_match = false;
			}
		    }
		}
466

Mac Newbold's avatar
Mac Newbold committed
467

468 469 470 471 472 473
		if (potential_match) {
		    vec->push_back(*it);
		    vnode_type_table[v->name].first++;
		    (*it)->refcount++;
#ifdef PCLASS_DEBUG
		    cerr << v->name << " can map to " << (*it)->name << endl;
474
#endif
475 476
		}
	    }
477

478 479 480 481 482 483 484 485 486
	    if (vclass) { 
		mit++;
		if (mit == vclass->members.end()) {
		    break;
		}
	    } else {
		// If not a vtype, we only had to do this once
		break;
	    }
487
	}
488

489
	if (vnode_type_table[v->name].first == 0) {
490
	    cout << "  *** No possible mapping for " << v->name << endl;
491 492
	    // Make an attempt to figure out why it didn't match
	    if (!matched_links) {
493
		cout << "      Too many links!" << endl;
494
	    }
495

496
	    if (!matched_bw) {
497
		cout << "      Too much bandwidth on emulated links!" << endl;
498
	    }
499

500 501 502 503
	    for (tb_vnode::desires_count_map::iterator dit = matched_desires.begin();
		    dit != matched_desires.end();
		    dit++) {
		if (dit->second == 0) {
504
		    cout << "      No physical nodes have feature " << dit->first
505 506
			<< "!" << endl;
		}
507
	    }
508
	    ok = false;
509
	}
510 511 512
#ifdef PCLASS_DEBUG
	cerr << v->name << " can map to " << vnode_type_table[v->name].first << " pclasses"
	    << endl;
513
#endif
514

515
    }
516

517 518 519
    if (ok) {
	cout << "Node mapping precheck succeeded" << endl;
	return 1;
520
    } else {
521 522
	cout << "Node mapping precheck failed!" << endl;
	return 0;
523 524
    }

525 526 527
#else // PER_VNODE_TT
    // PER_VNODE_TT is required for this check, just pretend it's OK.
    return 1;
Robert Ricci's avatar
Robert Ricci committed
528
#endif
529
}
Christopher Alfeld's avatar
 
Christopher Alfeld committed
530

531 532 533 534
int main(int argc,char **argv)
{
  int seed = 0;
  crope viz_prefix;
535
  bool scoring_selftest = false;
536 537 538 539 540
  
  // Handle command line
  char ch;
  timelimit = 0.0;
  timetarget = 0.0;
541
  while ((ch = getopt(argc,argv,"s:v:l:t:rpPTdH:")) != -1) {
542 543 544 545
    switch (ch) {
    case 's':
      if (sscanf(optarg,"%d",&seed) != 1) {
	print_help();
546
      }
547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563
      break;
    case 'v':
      viz_prefix = optarg;
      break;
#ifdef TIME_TERMINATE
    case 'l':
      if (sscanf(optarg,"%lf",&timelimit) != 1) {
	print_help();
      }
      break;
#endif
#ifdef TIME_TARGET
    case 't':
      if (sscanf(optarg,"%lf",&timetarget) != 1) {
	print_help();
      }
      break;
564
#endif
565 566 567
    case 'r':
      allow_trivial_links = false; break;
    case 'p':
568
      disable_pclasses = true; break;
Robert Ricci's avatar
Robert Ricci committed
569 570 571 572
#ifdef PER_VNODE_TT
    case 'P':
      prune_pclasses = true; break;
#endif
573 574
    case 'T':
      scoring_selftest = true; break;
575 576
    case 'd':
      dynamic_pclasses = true; break;
577 578 579 580 581
    case 'H':
      if (sscanf(optarg,"%lf",&scale_neighborhood) != 1) {
	print_help();
      }
      break;
582 583
    default:
      print_help();
584
    }
585
  }
586 587 588 589 590 591 592 593 594
  argc -= optind;
  argv += optind;
  
  if (seed == 0) {
    if (getenv("ASSIGN_SEED") != NULL) {
      sscanf(getenv("ASSIGN_SEED"),"%d",&seed);
    } else {
      seed = time(NULL)+getpid();
    }
595
  }
596 597 598 599

  if (viz_prefix.size() == 0) {
    if (getenv("ASSIGN_GRAPHVIZ") != NULL) {
      viz_prefix = getenv("ASSIGN_GRAPHVIZ");
600
    }
601
  }
Mac Newbold's avatar
Mac Newbold committed
602

603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625
  if (argc == 0) {
    print_help();
  }

  // Convert options to the common.h parameters.
  parse_options(argv, options, noptions);
#ifdef SCORE_DEBUG
  dump_options("Configuration options:", options, noptions);
#endif

#ifdef GNUPLOT_OUTPUT
  scoresout = fopen("scores.out","w");
  tempout = fopen("temp.out","w");
  deltaout = fopen("delta.out","w");
#endif

  cout << "seed = " << seed << endl;
  std::srandom(seed);

  read_physical_topology(argv[0]);
  calculate_switch_MST();
  
  cout << "Generating physical equivalence classes:";
626
  generate_pclasses(PG,disable_pclasses,dynamic_pclasses);
627
  cout << pclasses.size() << endl;
628

629 630 631
#ifdef PCLASS_DEBUG
  pclass_debug();
#endif
632 633

  read_virtual_topology(argv[1]);
634

635 636
  // Run the type precheck
  if (!type_precheck()) {
Robert Ricci's avatar
Robert Ricci committed
637
      exit(2);
638
  }
639

640 641
  // Run the mapping precheck
  if (!mapping_precheck()) {
Robert Ricci's avatar
Robert Ricci committed
642
      exit(2);
643
  }
Robert Ricci's avatar
Robert Ricci committed
644

645
#ifdef PER_VNODE_TT
Robert Ricci's avatar
Robert Ricci committed
646 647 648
  if (prune_pclasses) {
      prune_unusable_pclasses();
  }
649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668
#endif

  // Output graphviz if necessary
  if (viz_prefix.size() != 0) {
    crope vviz = viz_prefix + "_virtual.viz";
    crope pviz = viz_prefix + "_physical.viz";
    crope sviz = viz_prefix + "_switch.viz";
    ofstream vfile,pfile,sfile;
    vfile.open(vviz.c_str());
    write_graphviz(vfile,VG,vvertex_writer(),vedge_writer(),graph_writer());
    vfile.close();
    pfile.open(pviz.c_str());
    write_graphviz(pfile,PG,pvertex_writer(),pedge_writer(),graph_writer());
    pfile.close();
    sfile.open(sviz.c_str());
    write_graphviz(sfile,SG,svertex_writer(),sedge_writer(),graph_writer());
    sfile.close();
  }
 
  timestart = used_time();
669
  anneal(scoring_selftest, scale_neighborhood);
670
  timeend = used_time();
671

672 673 674 675 676 677
#ifdef GNUPLOT_OUTPUT
  fclose(scoresout);
  fclose(tempout);
  fclose(deltaout);
#endif

678
  if ((get_score() > absbest) || (violated > absbestviolated)) {
679
    cerr << "Internal error: Invalid migration assumptions." << endl;
680
    cerr << "score:" << get_score() << " absbest:" << absbest <<
681 682 683 684
      " violated:" << violated << " absbestviolated:" <<
      absbestviolated << endl;
    cerr << "  Contact calfeld" << endl;
  }
685
  
686
  cout << "   BEST SCORE:  " << get_score() << " in " << iters <<
687 688 689 690
    " iters and " << timeend-timestart << " seconds" << endl;
  cout << "With " << violated << " violations" << endl;
  cout << "Iters to find best score:  " << iters_to_best << endl;
  cout << "Violations: " << violated << endl;
691
  cout << vinfo;
692

693
  print_solution();
694 695 696 697 698 699 700 701 702 703 704

  if (viz_prefix.size() != 0) {
    crope aviz = viz_prefix + "_solution.viz";
    ofstream afile;
    afile.open(aviz.c_str());
    write_graphviz(afile,VG,solution_vertex_writer(),
		   solution_edge_writer(),graph_writer());
    afile.close();
  }
  
  if (violated > 0) {
Robert Ricci's avatar
Robert Ricci committed
705
      return 1;
706 707 708
  } else {
      return 0;
  }
709
}
710