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: 10 18, 2002 Time: 15:25:36 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 = 1.3888 seconds MAX CPU = 1.4308 seconds AVG CPU = 1.4059 seconds MIN WALL = 1.3926 seconds MAX WALL = 1.4365 seconds AVG WALL = 1.4101 seconds Total time to run: MIN CPU = 18.1575 seconds MAX CPU = 18.1946 seconds AVG CPU = 18.1806 seconds MIN WALL = 18.1718 seconds MAX WALL = 18.2097 seconds AVG WALL = 18.1951 seconds ******DETAILED TIMES FROM RUN****** Time to set up three-stepping tables MIN CPU = 7.9066 seconds MAX CPU = 7.9993 seconds AVG CPU = 7.9726 seconds MIN WALL = 7.9190 seconds MAX WALL = 8.0068 seconds AVG WALL = 7.9825 seconds Time to do three-stepping operations MIN CPU = 7.3805 seconds MAX CPU = 7.4684 seconds AVG CPU = 7.4227 seconds MIN WALL = 7.3866 seconds MAX WALL = 7.4735 seconds AVG WALL = 7.4280 seconds Time to gather three-stepping results MIN CPU = 0.0478 seconds MAX CPU = 2.4595 seconds AVG CPU = 1.6175 seconds MIN WALL = 0.0488 seconds MAX WALL = 2.4609 seconds AVG WALL = 1.6192 seconds Time to do sequential operations MIN CPU = 0.0107 seconds MAX CPU = 0.0254 seconds AVG CPU = 0.0192 seconds MIN WALL = 0.0107 seconds MAX WALL = 0.0244 seconds AVG WALL = 0.0191 seconds Time to do backtracking MIN CPU = 0.2996 seconds MAX CPU = 2.7679 seconds AVG CPU = 1.1196 seconds MIN WALL = 0.3018 seconds MAX WALL = 2.7666 seconds AVG WALL = 1.1209 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 ***