[gecode-users] Peak memory and recomputation

[Grégoire Dooms]

Hello,

I have observed the following effect which seems counter-intuitive to 
me: Using less recomputation can save memory.
Can you help me figure out what happens ?

The attached file models this simple problem using sets: generate all 
subgraphs of a complete labeled digraph (with loops).
The following runs are done with increasing fixed recomputation 
distance, very high (1000) adaptive distance and size 3.
The depth of the search tree  is from 9 to 12 (depending on the solutions).

I observe that with c_d = 4, the peak memory is much lower than with 3 
and 5:

When running it with -c_d 3, I get:
Summary
        runtime:      10
        solutions:    567
        propagations: 2449
        failures:     0
        clones:       566
        commits:      1548
        peak memory:  9 KB

With -c_d 4 :
Summary
        runtime:      0
        solutions:    567
        propagations: 3167
        failures:     0
        clones:       566
        commits:      1848
        peak memory:  1 KB

With -c_d 5 :
Summary
        runtime:      10
        solutions:    567
        propagations: 3648
        failures:     0
        clones:       566
        commits:      1935
        peak memory:  8 KB


Best,
--
Grégoire Dooms


-------------- next part --------------
A non-text attachment was scrubbed...
Name: test.cc
Type: text/x-c++src
Size: 2076 bytes
Desc: not available
URL: <http://www.ps.uni-sb.de/pipermail/users/attachments/20060331/ba9b5cac/attachment.cc>