GC performance / alternatives

Hi everyone,

When I allocate a new object my stack trace inside the Boehm GC gets about 10 functions deep. I assume boehm can't really be made much faster, but I heard the JVM can do this by just bumping a pointer, or something. What gives?

Is the SAW GC I see mentioned in bigloo 4.3 an alternative to Boehm? Apparently Ypsilon scheme has a 'realtime' collector, I wonder how difficult it would be to try that (or something else) wth bigloo.

Thanks,

bob