More embarrassing microbenchmars for D's GC.

[Leandro Lucarella]

Marius Muja, el 10 de junio a las 21:38 me escribiste:
> Leandro Lucarella wrote:
> >Considering that the version with GC disabled is almost as fast as the
> >malloc version, and that the time grows exponentially (graph attached)
> >with the number of nodes, it looks like the problem is the GC
> >collection cycles to me. Is the GC algorithm exponential?
> 
> The graph may look exponential but that's often misleading (it may very well be 
> a polynomial). To tell for sure plot the data on a graph with a logarithmic Y 
> axis and then on a graph with both axes logarithmic. If the plot is a straight 
> line on the semilogy graph then it's exponential. If it's a straight line on the 
> loglog graph then it's polinomial.

You and Sean are right, the graph somewhere in between linear and
exponential, but is really far from linear, which I think is the worst
case in GC algorithms...

-- 
Leandro Lucarella (luca) | Blog colectivo: http://www.mazziblog.com.ar/blog/
----------------------------------------------------------------------------
GPG Key: 5F5A8D05 (F8CD F9A7 BF00 5431 4145  104C 949E BFB6 5F5A 8D05)
----------------------------------------------------------------------------
Si pudiera acercarme un poco más, hacia vos
Te diría que me tiemblan los dos pies, cuando me mirás
Si supieras todo lo que me costó, llegar
Hoy sabrías que me cuesta respirar, cuando me mirás