From: Peter Dimov (pdimov_at_[hidden])
Date: 2005-08-19 04:28:49
Adrien Gervaise wrote:
> On Thu, 18 Aug 2005 19:05:13 +0200, Robert Ramey <ramey_at_[hidden]>
> wrote:
>
>> One question - "could reduce..." how much time did it actually save?
>
> Here are the results of some tests we performed when investigating the
> problem :
> The data set can be considered a random graph of objects. It is about
> 30MB large and is serialized several times in a row.
>
> Save number Without the pool With the pool
> 1 00:00:12 00:00:12
> 2 00:00:31 00:00:12
> 3 00:00:54 00:00:13
> 4 00:00:56 00:00:13
> 5 00:00:58 00:00:13
> 6 00:01:03 00:00:13
> 7 00:01:03 00:00:13
> 8 00:01:02 00:00:13
Can you try the same test with dlmalloc?
http://gee.cs.oswego.edu/dl/html/malloc.html