[Fwd: Re: (ITS#3851) Berkeley DB Scalability Patch]

[jongchoi@watson.ibm.com]

>I would think it acceptable to spend 12 minutes instead of 9 in adding
>100K entries if it is able to reduce the time for 4 million entries
>from 11 hours to just one.

I'm not saying that the BDB scalability patch has shown such a behavior
with small size DITs though. 

Without memory pressure, the linear allocator and the buddy allocator
would perform almost the same. Because of the internal fragmentation,
it is natural that the latter would experience memory pressure earlier
than the former. After a small window, the former will also be met with
the memory pressure and will eventually degenerate because of the
external fragmentation.