Benchmark #8s -- Dynamic Program 
 Large Sparse Matrices
Date:    Thu Oct 24 13:50:44 2002


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

Time for set up: 
time: Setup CPU    =       3.8728  seconds
time: Setup Wall   =       3.8750  seconds
Time to run: 
time: Run CPU    =     210.7828  seconds
time: Run Wall   =     210.9303  seconds

Lg probability of path = 
data:                             -369.0871

A few of the steps are:
Steps 0 through 19
data:   264532  238537  411968   12120  440560  155821  277079  417770  350019  136432
data:   419200  383091   85502  421661  156384  212097    8804  217804  341129  174225

Steps 250 through 269
data:   324036   87052  449832   83577  352752  118084    9668  198346  120540  113237
data:    82946  152724  102638  325630  198634   98500  468933  314970  260786  314727

Steps 481 through 500
data:   121388  107150  284873  350904  367143   26254  448059   25197   11077  335298
data:   271857  484452  276984  291326   42632  247711  286521  478682  427458   34779