next up previous contents
Next: Memory management Up: Compiling and using OPTIMQR Previous: The optimqr output files   Contents

A sample run

Using the input file described earlier, the optimqr program could be run like:
> ./optimqr system.size15
Using 0.680000 as acceptance factor
Using Output as output directory
Loading matrix structure... 15x15 system loaded.
System density is 20.000 %
Initializing memory subsystem...
dmh allocated 200000 solution buffers
dmh allocated 3150245 small buffers
Initial solution has f() = 1800
Starting branch-and-bound search...
09:08:21 (BB) live nodes: 0, (min,mean)g()+h():  (0,0)
(Delete)(Sort)(ln:45)
BB: Better solution found! f(s) = 120
(Delete)(Sort)(ln:228)
BB: Cleaned away 61 obsolete live nodes
BB: Better solution found! f(s) = 114
(Delete)(Sort)(ln:104)
BB: Cleaned away 44 obsolete live nodes
BB: max. no. of live nodes was: 290
BB: stopped after 33 iterations.
Optimal solution has f(best) = 114
Heuristic:
 572 calls
 0 late aborts
 0 early aborts
 abort value is 1800
DMH statistics:
 Free buffers:   199996
 Taken buffers:  4
 Allocs done:    577
 Frees done:     573
 Free sbuffers:  3150245
 Taken sbuffers: 0
 sAllocs done:   23921
 sFrees done:    23921
A lot of diagnostics are printed during the initialization of the optimizer. They can be of use, when tracking problems with the optimizer. During the optimization, a few lines will be printed whenever a better complete solution (ordering) is found. Also a diagnostic message is printed whenever the active branches are sorted. This is just to show that the optimizer is really running. Optimizing the 15 x 15 system on a ``high-end anno 1997'' PC takes roughly one second. Optimizing a 56 x 56 system takes almost an hour. Run-time depends heavily on system structure, and dimension.




1999-04-09