Running ParSA - Revision history

DemasMa: /* Job Runs */

2008-06-02T19:07:27Z

Job Runs

2008-06-02T19:06:22Z

2008-04-09T14:28:55Z

Running the MIR Solver/Scheduler

2008-03-26T20:11:00Z

Running the MIR Solver/Scheduler

2008-03-26T19:14:16Z

Running the MIR Solver/Scheduler

2008-03-26T19:05:03Z

Running the MIR Solver/Scheduler

2008-03-26T18:37:52Z

Answers to the MIR Questions

2008-03-26T18:25:37Z

Answers to the MIR Questions

2008-03-26T18:25:17Z

Running the MIR Solver/Scheduler

2008-03-26T18:24:36Z

Running the MIR Solver/Scheduler

← Older revision		Revision as of 19:07, 2 June 2008
Line 96:		Line 96:

	[[Image:BCF.jpg\|thumb\|right\|300 px\|A plot of BestCostFunktion versus Step Number]]		[[Image:BCF.jpg\|thumb\|right\|300 px\|A plot of BestCostFunktion versus Step Number]]
−
−	~~[[Image:Temperature.jpg\|thumb\|left\|300 px\|A plot of BestCostFunktion versus Step Number]]~~
−

	== Running the MIR Solver/Scheduler ==		== Running the MIR Solver/Scheduler ==

← Older revision		Revision as of 19:06, 2 June 2008
Line 119:		Line 119:
	[[Image:node_13_CF.jpg\|thumb\|Cost Function for Node 13 after about 5 ]]		[[Image:node_13_CF.jpg\|thumb\|Cost Function for Node 13 after about 5 ]]
	[[Image:node_13_CF_indiv.jpg\|thumb\|Cost Function for Node 13 indiv ]]		[[Image:node_13_CF_indiv.jpg\|thumb\|Cost Function for Node 13 indiv ]]
−	~~[[Image:PnCminVsN2.jpg\|thumb\|Plot 1 of Probability of Non-Convergence versus N (ln-ln plot)]]~~
−	~~[[Image:PnCminVsN3.jpg\|thumb\|Plot 1 of Probability of Non-Convergence versus N (ln-ln plot)]]~~

← Older revision		Revision as of 14:28, 9 April 2008
Line 119:		Line 119:
	[[Image:node_13_CF.jpg\|thumb\|Cost Function for Node 13 after about 5 ]]		[[Image:node_13_CF.jpg\|thumb\|Cost Function for Node 13 after about 5 ]]
	[[Image:node_13_CF_indiv.jpg\|thumb\|Cost Function for Node 13 indiv ]]		[[Image:node_13_CF_indiv.jpg\|thumb\|Cost Function for Node 13 indiv ]]
		+	[[Image:PnCminVsN2.jpg\|thumb\|Plot 1 of Probability of Non-Convergence versus N (ln-ln plot)]]
		+	[[Image:PnCminVsN3.jpg\|thumb\|Plot 1 of Probability of Non-Convergence versus N (ln-ln plot)]]

← Older revision		Revision as of 20:11, 26 March 2008
Line 117:		Line 117:

	[[Image:CF_alpha_pt5.jpg\|thumb\|Cost Function for >= 7 Independent Runs]]		[[Image:CF_alpha_pt5.jpg\|thumb\|Cost Function for >= 7 Independent Runs]]
−	[[Image:node_13_CF.jpg\|thumb\|Cost Function for Node 13 after ~~approx~~. 3]]	+	[[Image:node_13_CF.jpg\|thumb\|Cost Function for Node 13 after about 5 ]]
		+	[[Image:node_13_CF_indiv.jpg\|thumb\|Cost Function for Node 13 indiv ]]

← Older revision		Revision as of 19:14, 26 March 2008
Line 116:		Line 116:
	'''justification:''' A visual inspection of each of the nodes' cost functions shows less and less hill climbing as step number progresses (and temperature decreases). Since the number of this Cost Function density is periodic in step number, equalling about 7 in total (out of ten). The 7 is a result of the information from each node being taken before the end of the run. (NOTE: the claim about temperature versus the costfunction will need to be tested.)		'''justification:''' A visual inspection of each of the nodes' cost functions shows less and less hill climbing as step number progresses (and temperature decreases). Since the number of this Cost Function density is periodic in step number, equalling about 7 in total (out of ten). The 7 is a result of the information from each node being taken before the end of the run. (NOTE: the claim about temperature versus the costfunction will need to be tested.)

−	[[Image:CF_alpha_pt5.jpg]]	+	[[Image:CF_alpha_pt5.jpg\|thumb\|Cost Function for >= 7 Independent Runs]]
		+	[[Image:node_13_CF.jpg\|thumb\|Cost Function for Node 13 after approx. 3]]

← Older revision		Revision as of 19:05, 26 March 2008
Line 115:		Line 115:

	'''justification:''' A visual inspection of each of the nodes' cost functions shows less and less hill climbing as step number progresses (and temperature decreases). Since the number of this Cost Function density is periodic in step number, equalling about 7 in total (out of ten). The 7 is a result of the information from each node being taken before the end of the run. (NOTE: the claim about temperature versus the costfunction will need to be tested.)		'''justification:''' A visual inspection of each of the nodes' cost functions shows less and less hill climbing as step number progresses (and temperature decreases). Since the number of this Cost Function density is periodic in step number, equalling about 7 in total (out of ten). The 7 is a result of the information from each node being taken before the end of the run. (NOTE: the claim about temperature versus the costfunction will need to be tested.)
		+
		+	[[Image:CF_alpha_pt5.jpg]]

← Older revision		Revision as of 18:37, 26 March 2008
Line 108:		Line 108:
	=== Answers to the MIR Questions ===		=== Answers to the MIR Questions ===

−	~~''RESULTS (thus far):''~~
	The head node does not exchange answers with the other nodes. The BestCostFunktion file only contains the head node's information.		The head node does not exchange answers with the other nodes. The BestCostFunktion file only contains the head node's information.

@@ Line 107: / Line 107: @@
 === Answers to the MIR Questions ===
 ''RESULTS (thus far):''
 The head node does not exchange answers with the other nodes.  The BestCostFunktion file only contains the head node's information.
 '''justification:''' the minimum value of the head node's costfunction was the minimum found in the BCF file.  While other nodes had found lower solutions. I do not have proof of the 22991 value, but I do have proof of solutions in the 20k's.
 As far as I can tell now, the nodes all go through runs in unison.  That is they each heat up cool down 10 times.
 '''justification:''' A visual inspection of each of the nodes' cost functions shows less and less hill climbing as step number progresses (and temperature decreases).  Since the number of this Cost Function density is periodic in step number, equalling about 7 in total (out of ten).  The 7 is a result of the information from each node being taken before the end of the run. (NOTE: the claim about temperature versus the costfunction will need to be tested.)