November 12, 2006 Re: [Performance] shootout.binarytrees when implemented with gc is 10x slower than C# on .NET 2.0 | ||||
---|---|---|---|---|
| ||||
Posted in reply to Chris Miller | GC that performs faster than malloc!? Incredible! D needs this. -Craig "Chris Miller" <chris@dprogramming.com> wrote in message news:op.tiv11offpo9bzi@tanu... > On Sat, 11 Nov 2006 23:01:50 -0500, Craig Black <cblack@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). |
November 13, 2006 Re: [Performance] shootout.binarytrees when implemented with gc is 10x slower than C# on .NET 2.0 | ||||
---|---|---|---|---|
| ||||
Posted in reply to Craig Black | Craig Black wrote: > GC that performs faster than malloc!? Incredible! D needs this. > > -Craig > see: http://citeseer.ist.psu.edu/appel87garbage.html and http://home.pipeline.com/~hbaker1/CheneyMTA.html -DavidM |
Copyright © 1999-2021 by the D Language Foundation