Benchmark #8s -- Dynamic Program 
Large Sparse Matrices

Matrix Size =          500000
Entries per column   =      4
Number of matrices   =      2
Length of solution   =        2000
Partition sizes     =    40   50

Time to run: 
time: Run CPU        =     644.2166 seconds
time: Run Wall Clock =     644.5838 seconds

Lg probability of path = 
data:               -1483.7832

A few of the steps are:
Steps 0 through 19
data:    60452  236457  294289  140046  296414   23080  396297   68978   66238  327965
data:   131940  468303  400325   78159   92477  433447  340867  493939   69633   12994

Steps    1000 through    1019
data:   418317  112568  254128   19398  165638  360897   15952  202444  389329  328680
data:     2577  443313  352818   49847  175951  180150  340658  293417  417944  263649

Steps    1981 through    2000
data:     2952  391141  383942  202897  445111  146621  114089  360402  425389  182423
data:    21725   44833  440730  184238  459034  430652  339220  453526   42112   39417



*** NO ERRORS DETECTED ***