Well, I have no real idea. One thing of course is that one branching is worse, so you need more search and that takes more nodes and hence memory.
Then, the other thing is: does your branching have a big state? Or does it reference lots of variables (remember: variables are kept alive by propagator and branching, if a variable is not reference it will just go away). That's all what I would know Christian -- Christian Schulte, www.it.kth.se/~cschulte/ -----Original Message----- From: users-boun...@gecode.org [mailto:users-boun...@gecode.org] On Behalf Of Malcolm Ryan Sent: Thursday, May 07, 2009 4:05 AM To: gecode list Subject: [gecode-users] Tracking memory usage I am applying two different (custom) branchings to the same constraint problem and one of them is reporting a lot more memory use (via Statistics) than the other. This is not completely unexpected but the difference is big enough that it requires more careful analysis to make sure it isn't just the result of an implementation flaw. Is there any way you can recommend to track memory usage in a more fine-grained fashion? Malcolm _______________________________________________ Gecode users mailing list us...@gecode.org https://www.gecode.org/mailman/listinfo/gecode-users _______________________________________________ Gecode users mailing list us...@gecode.org https://www.gecode.org/mailman/listinfo/gecode-users
