Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot


by samtregar (Abbot)
on Feb 16, 2009 at 19:50 UTC ( [id://744188] : note . print w/replies, xml ) Need Help??

in reply to RFC: IPC::MMA

This looks very useful to me. It'd be interesting to see a caching module based on this. Would it beat Cache::FastMmap?

Performance info in general would be interesting - is this faster than the other available IPC modules? Or does it just offer more features? How does it compare to using BerkeleyDB, which is pretty fast for disk-based shared storage.


Replies are listed 'Best First'.
by cmac (Monk) on Feb 18, 2009 at 07:20 UTC
    One man (I believe he contributed to this thread) has kind of volunteered to build an interface between IPC::MMA and one of the caching modules. Although I may have forgotten to get back to him and encourage him to do this.

    As to performance, hopefully someone can do some benchmarking. The binary-search-based "hash" used in this module will hopefully beat a linked-list-based hash for larger numbers of key-value pairs. Don't know the exact cutover but maybe about 1000 entries?

    Thanks for your interest,