assign.cc 21.2 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
#include <sys/resource.h>
29 30
#include <signal.h>
#include <sys/signal.h>
31 32

using namespace boost;
Mac Newbold's avatar
Mac Newbold committed
33 34

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

// Here we set up all our graphs.  Need to create the graphs
// themselves and then setup the property maps.
47
tb_pgraph PG;
48 49 50 51 52 53 54 55 56 57
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.
58
name_count_map ptypes;
59 60

// List of virtual types by name.
61
name_count_map vtypes;
62
name_list_map vclasses;
63 64

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

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

77 78 79 80 81
// 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;
82

83 84
// Same, but for distances 
switch_dist_map_map switch_dist;
85

86 87
// Time started, finished, and the time limit
double timestart, timeend, timelimit, timetarget;
88

89 90 91
// An amount to scale the neighborhood size by
double scale_neighborhood = 1.0;

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

98
// Whether or not assign should use pclasses
99
bool disable_pclasses = false;
100

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

// Whether or not we should use the experimental support for dynamic pclasses
bool dynamic_pclasses = false;
107 108 109

// Whether or not to allow assign to temporarily over-subscribe pnodes
bool allow_overload = false;
Robert Ricci's avatar
Robert Ricci committed
110 111 112 113

// Forces assign to do greedy link assignment, by chosing the first link in its
// list, which is usually the lowest-cost
bool greedy_link_assignment = false;
114 115 116 117 118

// Forces assign to skip melting, and, instead, use the temperature given as
// the initial temperature
bool no_melting = false;
double initial_temperature = 0.0f;
119 120 121 122
  
// XXX - shouldn't be in this file
double absbest;
int absbestviolated, iters, iters_to_best;
Robert Ricci's avatar
Robert Ricci committed
123

124 125 126
/*
 * Internal functions
 */
Mac Newbold's avatar
Mac Newbold committed
127

Robert Ricci's avatar
Robert Ricci committed
128
// Return the CPU time (in seconds) used by this process
129 130 131 132 133 134 135 136
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
137
// Read in the .ptop file
138 139 140 141
void read_physical_topology(char *filename)
{
  ifstream ptopfile;
  ptopfile.open(filename);
Robert Ricci's avatar
Robert Ricci committed
142
  if (!ptopfile.is_open()) {
143
      cout << "Unable to open ptop file " << filename << endl;
144
      exit(EXIT_UNRETRYABLE);
Robert Ricci's avatar
Robert Ricci committed
145
  }
146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168
  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
169
#endif // DUMP_GRAPH
170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192

#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
193
#endif // GRAPH_DEBUG
194

Robert Ricci's avatar
Robert Ricci committed
195 196
  // Set up pnode2vertex - a mapping between vertices in the physical graph and
  // the pnodes that we just read in from the ptop file
197 198 199 200 201 202 203 204
  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
205 206
// Calculate the minimum spanning tree for the switches - we only consider one
// potential path between each pair of switches.
207
void calculate_switch_MST()
208
{
209
  cout << "Calculating shortest paths on switch fabric." << endl;
Robert Ricci's avatar
Robert Ricci committed
210 211

  // Set up the weight map for Dijkstra's
212 213 214 215 216 217 218 219 220 221
  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);
  }
222

Robert Ricci's avatar
Robert Ricci committed
223
  // Let boost do the Disjktra's for us, from each switch
224 225 226 227 228 229 230 231
  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])));
232 233
  }

234 235 236 237 238 239 240 241 242
#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
243
#endif // GRAPH_DEBUG
244 245
}

Robert Ricci's avatar
Robert Ricci committed
246
// Read in the .top file
247 248 249 250
void read_virtual_topology(char *filename)
{
  ifstream topfile;
  topfile.open(filename);
Robert Ricci's avatar
Robert Ricci committed
251
  if (!topfile.is_open()) {
252
      cout << "Unable to open top file " << filename << endl;
253
      exit(EXIT_UNRETRYABLE);
Robert Ricci's avatar
Robert Ricci committed
254
  }
255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280
  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
281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306
/*
 * 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;
}

307
void print_help()
308
{
309 310
  cout << "assign [options] ptopfile topfile [config params]" << endl;
  cout << "Options: " << endl;
311
#ifdef TIME_TERMINATE
312
  cout << "  -l <time>   - Limit runtime." << endl;
Mac Newbold's avatar
Mac Newbold committed
313
#endif
314 315
  cout << "  -s <seed>   - Set the seed." << endl;
  cout << "  -v <viz>    - Produce graphviz files with given prefix." <<
316
    endl;
317 318 319
  cout << "  -r          - Don't allow trivial links." << endl;
  cout << "  -p          - Disable pclasses." << endl;
  cout << "  -d          - Enable dynamic pclasses." << endl;
320
#ifdef PER_VNODE_TT
321
  cout << "  -P          - Prune unusable pclasses." << endl;
322
#endif
323 324 325
  cout << "  -T          - Doing some scoring self-testing." << endl;
  cout << "  -H <float>  - Try <float> times harder." << endl;
  cout << "  -o          - Allow overloaded pnodes to be considered." << endl;
326 327
  cout << "  -t <float>  - Start the temperature at <float> instead of melting."
      << endl;
328
  exit(EXIT_UNRETRYABLE);
329 330 331 332 333 334 335
}
 
// 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;
336

337
    bool ok = true;
Mac Newbold's avatar
Mac Newbold committed
338

339
    // First, check the regular types
340 341 342 343 344 345
    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()) {
346
	    cout << "  *** No physical nodes of type " << vtype_it->first
347 348
		<< " found" << endl;
	    ok = false;
349
	} else {
350 351
	    // Okay, there are some - are there enough?
	    if (ptype_it->second < vtype_it->second) {
352
		cout << "  *** " << vtype_it->second << " nodes of type " <<
353 354 355 356
		    vtype_it->first << " requested, but only "
		    << ptype_it->second << " found" << endl;
		ok = false;
	    }
357
	}
358
    }
359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378

    // Check the vclasses, too
    for (name_list_map::iterator vclass_it = vclasses.begin();
	    vclass_it != vclasses.end(); ++vclass_it) {
	bool found_match = false;
	for (vector<crope>::iterator vtype_it = vclass_it->second.begin();
		vtype_it != vclass_it->second.end(); vtype_it++) {
	    if (ptypes.find(*vtype_it) != ptypes.end()) {
		found_match = true;
		break;
	    }
	}

	if (!found_match) {
	    cout << "  *** No physical nodes can satisfy vclass " <<
		vclass_it->first << endl;
	    ok = false;
	}
    }

379 380 381 382 383 384 385 386
    if (ok) {
      cout << "Type preecheck passed." << endl;
      return 1;
    } else {
      cout << "Type precheck failed!" << endl;
      return 0;
    }
}
387

388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403
// 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);
404

405 406 407 408
    /*
     * Indicates whether all nodes have potential matches or not
     */
    bool ok = true;
409

410 411
    for (;vit != vendit;vit++) {
	tb_vnode *v = get(vvertex_pmap,*vit);
412

413 414 415 416 417 418 419 420 421 422 423 424 425 426 427
	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();
428
	}
429 430 431 432 433 434 435 436 437
	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;
	    }
438

439 440
	    for (pclass_vector::iterator it = type_table[this_type].second->begin();
		    it != type_table[this_type].second->end(); it++) {
441

442 443 444
		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
445

446 447 448 449 450
		// 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) ||
451
			(!pnode->current_type.compare("switch"))) {
452 453 454 455
		    matched_links++;
		} else {
		    potential_match = false;
		}
Mac Newbold's avatar
Mac Newbold committed
456

457 458 459 460 461 462
		// 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
463

464 465 466 467 468 469 470 471 472 473 474 475
		// Check to see if if the pnode has enough slots of the
		// appropriate type available
		tb_pnode::types_map::iterator mit = pnode->types.find(v->type);
		if (mit == pnode->types.end()) {
		    // Must have been a vtype to get here - ignore it
		} else {
		    if (v->typecount > mit->second->max_load) {
			// Nope, this vnode is too demanding
			potential_match = false;
		    }
		}

476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500
		//
		// 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
501

502 503 504 505 506 507 508 509 510 511 512 513 514 515 516
		// 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;
			}
		    }
		}
517

Mac Newbold's avatar
Mac Newbold committed
518

519 520 521 522 523 524
		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;
525
#endif
526 527
		}
	    }
528

529 530 531 532 533 534 535 536 537
	    if (vclass) { 
		mit++;
		if (mit == vclass->members.end()) {
		    break;
		}
	    } else {
		// If not a vtype, we only had to do this once
		break;
	    }
538
	}
539

540
	if (vnode_type_table[v->name].first == 0) {
541
	    cout << "  *** No possible mapping for " << v->name << endl;
542 543
	    // Make an attempt to figure out why it didn't match
	    if (!matched_links) {
544
		cout << "      Too many links!" << endl;
545
	    }
546

547
	    if (!matched_bw) {
548
		cout << "      Too much bandwidth on emulated links!" << endl;
549
	    }
550

551 552 553 554
	    for (tb_vnode::desires_count_map::iterator dit = matched_desires.begin();
		    dit != matched_desires.end();
		    dit++) {
		if (dit->second == 0) {
555
		    cout << "      No physical nodes have feature " << dit->first
556 557
			<< "!" << endl;
		}
558
	    }
559
	    ok = false;
560
	}
561 562 563
#ifdef PCLASS_DEBUG
	cerr << v->name << " can map to " << vnode_type_table[v->name].first << " pclasses"
	    << endl;
564
#endif
565

566
    }
567

568 569 570
    if (ok) {
	cout << "Node mapping precheck succeeded" << endl;
	return 1;
571
    } else {
572 573
	cout << "Node mapping precheck failed!" << endl;
	return 0;
574 575
    }

576 577 578
#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
579
#endif
580
}
581

582 583 584
// Signal handler - add a convneint way to kill assign and make it return an
// unretryable error
void exit_unretryable(int signal) {
585
    cout << "Killed with signal " << signal << " - exiting!" << endl;
586
    _exit(EXIT_UNRETRYABLE);
587 588
}

589 590 591 592
int main(int argc,char **argv)
{
  int seed = 0;
  crope viz_prefix;
593
  bool scoring_selftest = false;
594 595 596 597 598
  
  // Handle command line
  char ch;
  timelimit = 0.0;
  timetarget = 0.0;
Robert Ricci's avatar
Robert Ricci committed
599
  while ((ch = getopt(argc,argv,"s:v:l:t:rpPTdH:og")) != -1) {
600 601 602 603
    switch (ch) {
    case 's':
      if (sscanf(optarg,"%d",&seed) != 1) {
	print_help();
604
      }
605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621
      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;
622
#endif
623 624 625
    case 'r':
      allow_trivial_links = false; break;
    case 'p':
626
      disable_pclasses = true; break;
Robert Ricci's avatar
Robert Ricci committed
627 628 629 630
#ifdef PER_VNODE_TT
    case 'P':
      prune_pclasses = true; break;
#endif
631 632
    case 'T':
      scoring_selftest = true; break;
633 634
    case 'd':
      dynamic_pclasses = true; break;
635 636 637 638 639
    case 'H':
      if (sscanf(optarg,"%lf",&scale_neighborhood) != 1) {
	print_help();
      }
      break;
640 641
    case 'o':
      allow_overload = true; break;
Robert Ricci's avatar
Robert Ricci committed
642 643
    case 'g':
      greedy_link_assignment = true; break;
644 645 646 647 648
    case 't':
      if (sscanf(optarg,"%lf",&initial_temperature) != 1) {
	print_help();
      }
      no_melting = true; break;
649 650
    default:
      print_help();
651
    }
652
  }
653 654 655 656 657 658 659 660 661
  argc -= optind;
  argv += optind;
  
  if (seed == 0) {
    if (getenv("ASSIGN_SEED") != NULL) {
      sscanf(getenv("ASSIGN_SEED"),"%d",&seed);
    } else {
      seed = time(NULL)+getpid();
    }
662
  }
663 664 665 666

  if (viz_prefix.size() == 0) {
    if (getenv("ASSIGN_GRAPHVIZ") != NULL) {
      viz_prefix = getenv("ASSIGN_GRAPHVIZ");
667
    }
668
  }
Mac Newbold's avatar
Mac Newbold committed
669

670 671 672 673
  if (argc == 0) {
    print_help();
  }

674 675 676 677 678 679 680

  // Set up a signal handler for USR1 that exits with an unretryable error
  struct sigaction action;
  action.sa_handler = exit_unretryable;
  sigemptyset(&action.sa_mask);
  action.sa_flags = 0;
  sigaction(SIGUSR1,&action,NULL);
681
  sigaction(SIGINT,&action,NULL);
682

683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701
  // 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:";
702
  generate_pclasses(PG,disable_pclasses,dynamic_pclasses);
703
  cout << pclasses.size() << endl;
704

705 706 707
#ifdef PCLASS_DEBUG
  pclass_debug();
#endif
708 709

  read_virtual_topology(argv[1]);
710

711 712
  // Run the type precheck
  if (!type_precheck()) {
713
      exit(EXIT_UNRETRYABLE);
714
  }
715

716 717
  // Run the mapping precheck
  if (!mapping_precheck()) {
718
      exit(EXIT_UNRETRYABLE);
719
  }
Robert Ricci's avatar
Robert Ricci committed
720

721
#ifdef PER_VNODE_TT
Robert Ricci's avatar
Robert Ricci committed
722 723 724
  if (prune_pclasses) {
      prune_unusable_pclasses();
  }
725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742
#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();
  }
743 744 745 746 747 748 749 750 751

  // Handle the initial temperature, if one was given - a NULL initial temp.
  // means that we should start with the normal melting procedure
  double *initial_temperature_pointer;
  if (no_melting) {
    initial_temperature_pointer = &initial_temperature;
  } else {
    initial_temperature_pointer = NULL;
  }
752 753
 
  timestart = used_time();
754
  anneal(scoring_selftest, scale_neighborhood, initial_temperature_pointer);
755
  timeend = used_time();
756

757 758 759 760 761 762
#ifdef GNUPLOT_OUTPUT
  fclose(scoresout);
  fclose(tempout);
  fclose(deltaout);
#endif

763
  if ((!compare_scores(get_score(),absbest)) || (violated > absbestviolated)) {
764 765
    cout << "Internal error: Invalid migration assumptions." << endl;
    cout << "score:" << get_score() << " absbest:" << absbest <<
766 767
      " violated:" << violated << " absbestviolated:" <<
      absbestviolated << endl;
768
    cout << "  Contact calfeld" << endl;
769
  }
770
  
771
  cout << "   BEST SCORE:  " << get_score() << " in " << iters <<
772 773 774 775
    " 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;
776
  cout << vinfo;
777

778
  print_solution();
779 780 781 782 783 784 785 786 787 788

  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();
  }
  
Robert Ricci's avatar
Robert Ricci committed
789
  if (violated != 0) {
790
      exit(EXIT_RETRYABLE);
791
  } else {
792
      exit(EXIT_SUCCESS);
793
  }
794
}
795