Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Re: RFC: IPC::MMA

by samtregar (Abbot)
on Feb 16, 2009 at 19:50 UTC ( #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.

-sam


Comment on Re: RFC: IPC::MMA
Re^2: RFC: IPC::MMA
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,
    cmac

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://744188]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (12)
As of 2014-07-28 19:32 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (207 votes), past polls