⇤ ← Revision 1 as of 2013-09-28 12:53:56
2512
Comment:
|
2579
|
Deletions are marked like this. | Additions are marked like this. |
Line 8: | Line 8: |
Your program should output a table such as: | Your program should produce output such as: |
Line 10: | Line 10: |
PATH pHAT a12,a23,a34,a46 0.5726 a13,a36 0.0181 a12,a25,a56 0.0015 a12,a23,a36 0.0945 a14,46 0.1944 a13,a34,a46 0.1189 |
OUTPUT :a12,a23,a34,a46: 0.5726 OUTPUT :a13,a36: 0.0181 OUTPUT :a12,a25,a56: 0.0015 OUTPUT :a12,a23,a36: 0.0945 OUTPUT :a14,46: 0.1944 OUTPUT :a13,a34,a46: 0.1189 |
Line 19: | Line 18: |
The "prettiness" of this table will not be graded, but it must contain: | The paths should be formatted without any intervening whitespace, beware: {{{ OUTPUT :a12, a23, a34, a46: 0.5726 }}} is no good |
Line 21: | Line 24: |
1. The header line 2. The paths as formatted without any intervening whitespace, beware: {{{ a12, a23, a34, a46 0.5726 }}} is no good 3. The point estimate for the path given `s` and `RUNS`, the seed and number of runs in the experiment |
The value provided for each path is the critical path point estimate described in the book given `s` and `RUNS`, the seed and number of runs in the experiment. Report all point estimates to four decimal places. |
Line 29: | Line 26: |
Note that the there is no specific order to the output,<<FootNote(Because we have `sort -n -k2` at our disposal)>> but you '''must''' provide an entry for all '''possible''' paths. |
'''Note that the there is no specific order''' to the output,<<FootNote(Because we have `sort -n -k2` at our disposal)>> but you '''must''' provide an entry for all '''possible''' paths. |
Line 48: | Line 44: |
Per row, the first term is the source node, the second term is the destination node, and the third term is the upper bound for a '''uniform''' distribution. For instance, the distribution for the `a13` arc should be ''Uniform(0,2)''. The largest numbered node in the second column may always be considered the ''terminal node'' and node 1 will always be ''single source'' node of the network. |
Per row, the first term is the source node, the second term is the destination node, and the third term is the upper bound for a '''uniform''' distribution. For instance, the distribution for the `a13` arc should be ''Uniform(0,2)''. The largest numbered node in the second column may always be considered the ''terminal node'' and node 1 will always be ''single source'' node of the network. |
Write a program SIM (meeting the usual requirements) that reproduces the results of the SAN on page 83. When invoked as
$ SIM B s RUNS
Your program should produce output such as:
OUTPUT :a12,a23,a34,a46: 0.5726 OUTPUT :a13,a36: 0.0181 OUTPUT :a12,a25,a56: 0.0015 OUTPUT :a12,a23,a36: 0.0945 OUTPUT :a14,46: 0.1944 OUTPUT :a13,a34,a46: 0.1189
The paths should be formatted without any intervening whitespace, beware:
OUTPUT :a12, a23, a34, a46: 0.5726
is no good
The value provided for each path is the critical path point estimate described in the book given s and RUNS, the seed and number of runs in the experiment. Report all point estimates to four decimal places.
Note that the there is no specific order to the output,1 but you must provide an entry for all possible paths.
When SIM is invoked as
$ SIM F s RUNS network.txt
Your program should read the data for an arbitrary network from the fourth parameter and produce the same tablular output as for the B scenario. The interprettation of s and RUNS is identical to the B scenario as well.
An example of the network data format (for this SAN) is:
1 2 3 2 3 5 1 4 6 1 3 2 4 3 1.5 4 5 6 3 5 4
Per row, the first term is the source node, the second term is the destination node, and the third term is the upper bound for a uniform distribution. For instance, the distribution for the a13 arc should be Uniform(0,2). The largest numbered node in the second column may always be considered the terminal node and node 1 will always be single source node of the network.
Submit Your Work
Log into the course website and submit your project archive file for grading.
Rubric
This work is worth 36 points.
Requirements |
Points |
Notes |
10 |
|
|
Experiment 'B' |
10 |
|
Experiment 'F' |
15 |
|
Correct submission |
1 |
|
Because we have sort -n -k2 at our disposal (1)