Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
Is OCaml fast?
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2010-11-23 (20:30)
From: Isaac Gouy <igouy2@y...>
Subject: Re: Is OCaml fast?
Gerd Stolpmann <info <at>> writes:

> I do not say that it is complete nonsense to do this comparison, but
> only that it is more specific than a reader would assume.

A reader's wrong assumptions are their own responsibility:

> The innocent reader expects a comparison of binary tree performance,
> not of methods of managing memory (and this is it finally).

Perhaps rather than "innocent reader" you mean careless reader who didn't bother
to read what the programs should do?

> The true name of this test should be 
> "manage_many_small_memory_cells_where_pools_are_allowed". 

"binary-trees benchmark : Allocate and deallocate many many binary trees"

> (It would be actually interesting to compare various versions of this test
> with different memory management methods.)

So do that comparison and publish the results.