[Performance] shootout.binarytrees when implemented with gc is 10x slower than C# on .NET 2.0

[Chris Miller]

On Sat, 11 Nov 2006 23:01:50 -0500, Craig Black <cblack at ara.com> wrote:

>> C# on .NET 2.0     :  1.902 sec
>> DMD 0.173 - malloc(original version)  :  5.189 sec
>> C# on Mono 1.1.18 :  6.630 sec
>> DMD 0.173 - full GC : 19.720 sec
>
> I see that C# GC is faster than DMD's malloc.  How is this possible?  Did
> Microsoft figure out how to make the GC really fast, or is D's malloc  
> slow?

The type of GC used by .NET is just about as fast as stack allocation; a  
simple pointer is advanced. It's an upside to relocating data (copying  
collector).