Modify T so it is evenly divisible by 3*NUMPES T is now 99984 Benchmark 8 running ... N,K,T,ITER = 10 30 99984 400 Benchmark #8 -- Dynamic Program Small Dense Matrices Date: 9 18, 2001 Time: 10:20:47 Matrix size = 10 Number of matrices = 30 Number of iterations = 400 ******TOTAL TIMES FOR SET UP AND RUN****** Total time for set up: MIN CPU = 2.2087 seconds MAX CPU = 2.2780 seconds AVG CPU = 2.2378 seconds MIN WALL = 2.2198 seconds MAX WALL = 2.3213 seconds AVG WALL = 2.2535 seconds Total time to run: MIN CPU = 28.9433 seconds MAX CPU = 29.0887 seconds AVG CPU = 29.0409 seconds MIN WALL = 29.1496 seconds MAX WALL = 29.2553 seconds AVG WALL = 29.2196 seconds ******DETAILED TIMES FROM RUN****** Time to set up three-stepping tables MIN CPU = 11.9580 seconds MAX CPU = 12.1092 seconds AVG CPU = 12.0430 seconds MIN WALL = 12.0109 seconds MAX WALL = 12.1367 seconds AVG WALL = 12.0725 seconds Time to do three-stepping operations MIN CPU = 11.7140 seconds MAX CPU = 11.8369 seconds AVG CPU = 11.7694 seconds MIN WALL = 11.7434 seconds MAX WALL = 11.8690 seconds AVG WALL = 11.7943 seconds Time to gather three-stepping results MIN CPU = 0.5885 seconds MAX CPU = 4.7170 seconds AVG CPU = 3.7455 seconds MIN WALL = 0.6708 seconds MAX WALL = 4.8448 seconds AVG WALL = 3.8349 seconds Time to do sequential operations MIN CPU = 0.0195 seconds MAX CPU = 0.0400 seconds AVG CPU = 0.0284 seconds MIN WALL = 0.0176 seconds MAX WALL = 0.0391 seconds AVG WALL = 0.0283 seconds Time to do backtracking MIN CPU = 0.3738 seconds MAX CPU = 4.6760 seconds AVG CPU = 1.4106 seconds MIN WALL = 0.3779 seconds MAX WALL = 4.6944 seconds AVG WALL = 1.4494 seconds Statistics on final iteration: Length of solution on last iteration = 100000 Lg probability of path = -430061.1833 A few of the steps are: Steps 0 through 19 10 9 6 3 2 2 3 2 2 5 10 9 3 6 6 8 7 5 10 5 Steps 50000 through 50019 5 10 9 2 2 5 10 9 4 8 1 4 7 5 10 10 7 5 10 10 Steps 99981 through 100000 10 10 10 9 2 2 2 2 3 10 9 3 10 9 6 6 6 6 3 4 *** NO ERRORS DETECTED ***