[gecode-users] peak memory value

[Christian Schulte]

That's just fine, adaptive recomputation might create more copies if failure
occurs. Rather than explaining it, check it out yourself: use Gist and
switch on "Show clones in tree" in the search preferences.

 

Cheers

Christian

 

--

Christian Schulte, Professor of Computer Science, KTH,
www.ict.kth.se/~cschulte/

 

From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf
Of Yong LIN
Sent: Wednesday, October 02, 2013 2:47 PM
To: users at gecode.org
Subject: [gecode-users] peak memory value

 

Hi All,

I understand the how adaptive recomputation works, but I still have a
question regarding the peak memory usage of adaptive recomputation.

For the Ortho-Latin problem, I ran the script by the following two command
line respectively:

1.   ./ortho-latin  -c-d 8 -a-d 2 -solutions 1

2.  ./ortho-latin  -c-d 10000 -a-d 2 -solutions 1



These two commands explore the exactly same search tree. It is expected that
the first run will place a bit more space copies within the search tree than
the second, and thus have a larger peak memory value. However, I checked
that the peak memory usage of the first command is 1319 K; the peak memory
for the second command is 1511K. How do you think about it? Thanks! 



regards,

Lin 





For the search tree information of ortho-latin:
   
peak depth: 46
first solution found at level: 44
first failure happened at level: 22

All failures happened at deeper level than the first failure.


 



















-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.gecode.org/pipermail/users/attachments/20131002/037a7c57/attachment.html>