Jim et al, > For various reasons it is awkward for all Judy allocations to come out > of the global heap managed by malloc/free. We want to manage separate > pools (heaps) and be able to specify for each Judy array which pool > should be used for all memory allocs/frees done by the array.
Gotcha. I'm wondering how you get multiple heaps. Been a while, I'm rusty. I know sbrk() is the *NIX way to get to quadrant-1 heap (right?), but newer alternative memory methods let you access shared memory or other address spaces? Or do modern malloc()s let you just specify a heap and somehow manage this for you? The fact that you are worried about this level of performance is both inspiring and depressing. I guess libJudy is doing good things for you but you still need it to be faster. > I agree that malloc/free has excellent performance and that it was a > good choice to have Judy use malloc as opposed to some other memory > allocator using a single heap. What other allocator? :-) Pretty much they are all called "malloc", but implementations vary greatly. Oh, I remembered, it's Ian Lea malloc() that Doug liked. Sounds to me like you and others have a much better grasp of the technicalities today than I do -- sorry. I made heavy and happy use of libJudy myself as a consumer 2007-2009, but haven't looked inside the code since 2002 when I helped develop it on HP. Also haven't heard from Doug Baskins, the main inventor, for several years. Dunno what he's up to. Cheers, Alan Silverstein ------------------------------------------------------------------------------ Lotusphere 2011 Register now for Lotusphere 2011 and learn how to connect the dots, take your collaborative environment to the next level, and enter the era of Social Business. http://p.sf.net/sfu/lotusphere-d2d _______________________________________________ Judy-devel mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/judy-devel
