Benchmark #8 -- Dynamic Program 
 Large Sparse Matrices
Date:    Tue Sep 18 10:48:42 2001


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

Time for set up: 
CPU         =       7.7407  seconds
Wall Clock  =       7.8527  seconds
Time to run: 
CPU         =     667.3615  seconds
Wall Clock  =     683.7779  seconds

Lg probability of path =       -1479.1363

A few of the steps are:
Steps 0 through 19
  467889  173885  764046  600299  452141  379535  388487  398500  106376  593273
  726013   19257  775966  654583  127870  901938   24876  907441  466286  676474

Steps 1000 through 1019
  341712  105286  866888  271003  922289  538413  846022  315656  209633 1047908
  951196  841690  849256  129771  607146  980528  837442 1048384  549748  991206

Steps 1981 through 2000
  222064  465539  120036 1047374  798344  449745   78424  201333  544239  581864
  753577  209341  182789 1013734 1046649  154247  639124  542591   15204  547307

*** NO ERRORS DETECTED ***