In general, the memory use in my search problem seems to be quite a lot larger than I expected. I have a system with about 250 IntVars. I did a search and found a solution with the following statistics:
Clones: 23 Commits: 178 Fails: 0 Propagates: 276937 Memory: 62.4 Mb (65477136 bytes) That seems like an awfully large amount of memory for a relatively small problem. How do I work out what is causing this? In general, what are the factors that contribute towards memory usage and how do I control them? Malcolm On 30/03/2008, at 4:53 PM, Malcolm Ryan wrote: > My searches in Gecode/J are crashing when with messages like: > > java(221,0xb0801000) malloc: *** mmap(size=65536) failed (error > code=12) > *** error: can't allocate region > *** set a breakpoint in malloc_error_break to debug > terminate called after throwing an instance of > 'Gecode::MemoryExhausted' > what(): Memory: Heap memory exhausted > > Is there any way to avoid these, or at least to make the search fail > more gracefully? > > Malcolm > > _______________________________________________ > Gecode users mailing list > [EMAIL PROTECTED] > https://www.gecode.org/mailman/listinfo/gecode-users _______________________________________________ Gecode users mailing list [EMAIL PROTECTED] https://www.gecode.org/mailman/listinfo/gecode-users
