On Wednesday 25 April 2007 10:00, Jonathan Worthington wrote:

> Basically, if you run the program without -G and then break it, it will
> usually break inside the GC routine. What I do remember is that it was
> looping through some kinda memory pool, or arena, or whatever. However,
> the thing it was looping through was *huge* (like, from 0 to a six
> figure number) and I think it maybe was an n^2 algorithm, which
> amplified the effect further.

This reminds me of the subtitle of a terrible Star Trek movie: Generations.

I wonder if we performing smaller collections and compacting only up to a 
certain threshold would perform better.

-- c

Reply via email to