[Mono-devel-list] GC/Memory allocation performance

Tony Garnock-Jones tonyg at lshift.net
Fri May 30 11:22:21 EDT 2003

Paolo Molaro wrote:
>>It would be easy to create an optimized version for the common
>>case (no profiler, no remoting etc.). I could do this if
>>there is interest.
> In those kind of microbenchmarks, a generational GC will always perform
> better and the MS GC is also very good at that. In real word code the
> difference may be considerably less.

I'm currently writing a Scheme -> IL compiler that uses the 
continuation-passing-transform as part of generating the code.

The upshot of this is that running compiled Scheme code generates 
**LOTS** of little closures... just mentioning it since it would be 
lovely to have good support for generating heaps of smallish (around <= 
128 bytes per closure??) instant garbage objects :-)

Copying GC handily outperforms mark/sweep GC in these cases.


More information about the Mono-devel-list mailing list