On 2/3/06, Vlad Seryakov <[EMAIL PROTECTED]> wrote:
>
> Here is the test http://www.crystalballinc.com/vlad/tmp/memtest.c
>
> It give very strange results, it works for Linux only because it uses
> mmap only and it looks like brk uses mmap internally according to Linux
> 2.6.13 kernel and it allows unlimited mmap-ed regions (or as i
> understand up to vm.max_map_count = 65536).
>
> According to this test, when i use random sizes from 0-128k, Tcl
> allocator gives worse results than Linux malloc. On small amounts
> ckalloc faster but once over 64k, Linux malloc is faster. And, my small
> malloc implementaion which is based on first version of Lea's malloc and
> uses mmap only and supports per-thread memory only beats all mallocs,
> especially on bigger sizes. It does not crash, even on 5Mil loops, but i
> am not sure why it is so simple and so effective.
Have you taken fragmentation into account?
There's some memory related links in this blog post I read recently:
http://primates.ximian.com/~federico/news-2005-12.html#14
Federico makes a good point: this has all been done before...
