- 17 Oct, 2003 1 commit
-
-
Leigh B. Stoller authored
Blew it up with the current set of 145 remote nodes. I increased the limits and added checks so that it does not return bogus output. Needs a pass to turn them into dynamically sized arrays, at some point.
-
- 20 Sep, 2002 1 commit
-
-
Chad Barb authored
- Increased the point penalty for using a link which is marked as -1 ("not-connected") in the physical matrix. (Was 10,000; is now 100,000.) - Now we actually report an error, and return errorcode 6, if the final reported solution uses any not-connected links.
-
- 15 Jul, 2002 1 commit
-
-
Chad Barb authored
Changed behavior: If "-s <seed>" is not specified, a timeofday-dependent random seed will be used. In any case, when in verbose mode, the random seed used will be printed out at the beginning of the run.
-
- 07 Jul, 2002 1 commit
-
-
Leigh B. Stoller authored
-
- 04 Jun, 2002 1 commit
-
-
Chad Barb authored
-
- 30 May, 2002 2 commits
-
-
Chad Barb authored
Return an error if a negative weight is passed to -1, -2, or -3. Also, interpret negative values of minrounds as zero. Also, interpret any negative value for maxrounds as -1.
-
Chad Barb authored
Added loss metric (-3 switch; must be used after -2 switch.).. Also added -1 switch to specify latency weight.
-
- 22 May, 2002 1 commit
-
-
Chad Barb authored
(Added for my timing tests.)
-
- 16 May, 2002 1 commit
-
-
Chad Barb authored
placing a "-1" anywhere in the latency or bandwidth matrices will result in huge penalties when that connection is used in the mapping. Also added neat (possibly novel?) "mutation spike" which, when the standard deviation of the population gets beneath a certain value, spikes the mutation rate from 1% to 50% for a generation, thus keeping the deviation (and the population diversity) up. Results from testing look promising.. in my "standard" 6-node mapping, the solver finds the "best" solution in 95% of the runs. (vs about 50% or less the old way.)
-
- 15 May, 2002 4 commits
-
-
Chad Barb authored
-
Chad Barb authored
Added "crossover rate" to improve population stability. Changed termination behavior to stop if, after, 256 rounds, no better solution has been found (changable with the -r switch.)
-
Chad Barb authored
(smaller population, non-in-place child building, proper 'roulette' selection function, etc.)
-
Chad Barb authored
*<name of pnode> to <name of vnode> <name of pnode> This means that fixed vnodes may have unique names (not just the name of the pnode they are fixed to.) Added "-v -v" mode, "-v" now just outputs progress without "friendly" prompts/output or error analysis. Fixed bizarre bug in mutation engine that was wedging the solver. (Should also allow for expts with only 1 non-fixed node.) Added check to skip solving altogether if there are 0 non-fixed nodes. (this also handles the edge case of an input with no virtual nodes.) Added check to exit with errorcode if there are more virtual nodes than can be mapped.
-
- 14 May, 2002 3 commits
- 13 May, 2002 1 commit
-
-
Chad Barb authored
- Changed internal representation to accommodate >1 vnodes per pnode. - Added '-m' option to allow the user to specify the maximum number of vnodes mappable onto each pnode. (if -m is not specified, only one vnode is allowed per pnode) - Added ability to "fix" a permanent mapping from a vnode to a pnode. When specifying a vnode name, use the name of a pnode, with a "*" prepended. This will be useful to fix one node as "The Testbed Node." See comments at beginning of source for full documentation.
-
- 10 May, 2002 1 commit
-
-
Chad Barb authored
Look at comment at beginning of wanlinksolve.cc for full documentation. Also added -v switch to turn on verbosity (now off by default.)
-
- 06 May, 2002 1 commit
-
-
Chad Barb authored
Wan (eg RON) link solver for delay, with accompianing script to fill in "physical" info part of input.
-