AW: [Mono-devel-list] GC/Memory allocation performance
mathpup at mylinuxisp.com
Fri May 30 15:27:43 EDT 2003
Doesn't Boehm's GC have a compacting mode? I know that SRC Modula-3 (and its
descendants) for over 10 years have used a Boehm GC that is generational,
incremental, and compacting.
On Friday 30 May 2003 8:32 am, Jörg Rosenkranz wrote:
> Hi Zoltan,
> I think the garbage collector should be working in all cases.
> So a special version isn't the right direction?
> Maybe this performance difference depends more on the garbage
> collector implementation? As I understand it (very basic understanding ;-))
> in MS's implementation memory allocation is as simple as incrementing
> the pointer to the next free memory block by the amount of allocated
> memory. During collection all used blocks are shifted to avoid memory
> fragmentation. This may speed up allocation but pointers doesn't stay
> constant during runtime.
> How's Boehm's GC working? Maybe the fragmentation slows down memory
More information about the Mono-devel-list