[gecode-users] Peak memory and recomputation

[Christian Schulte]

What values did you use for a_d: adaptive recomputation might kick in an use
some memory for intermediate copies? For a discussion of that see my PhD
thesis ;-)

All the best
Christian

--
Christian Schulte, http://web.imit.kth.se/~schulte/




-----Original Message-----
From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf
Of Grégoire Dooms
Sent: Friday, March 31, 2006 4:35 PM
To: users at gecode.org
Subject: [gecode-users] Peak memory and recomputation


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