Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    text
    copied!<p>This is something i've wanted to write for some time, but there's always some more pressing thing to do...</p> <p>still, for most of the usecases of a shared key-data RAM store, <a href="http://www.danga.com/memcached/" rel="nofollow noreferrer">memcached</a> would be the simplest answer.</p> <p>In your case, it looks like it's lower-level, so it memcached, fast as it is, might not be the best answer. I'd try <a href="http://judy.sourceforge.net/" rel="nofollow noreferrer">Judy Arrays</a> on a <code>shmem</code> block. They're really fast, so even if you wrap the access with a simplistic lock, you'd still get high performance access.</p> <p>For more complex tasks, I'd search about lock-free structures (some links: <a href="http://www.erdani.org/publications/cuj-2004-10.pdf" rel="nofollow noreferrer">1</a>, <a href="http://research.microsoft.com/en-us/um/people/simonpj/Papers/stm/lock-free-flops06.pdf" rel="nofollow noreferrer">2</a>, <a href="http://www.audiomulch.com/~rossb/code/lockfree/liblfds/index.htm" rel="nofollow noreferrer">3</a>,<a href="http://udrepper.livejournal.com/14249.html" rel="nofollow noreferrer">4</a>). I even wrote <a href="http://javier.guerrag.com/2008/06/compiles-ship-it.html" rel="nofollow noreferrer">one</a> some time ago, with <a href="http://javier.guerrag.com/2008/05/lock-free-concurrent-lua.html" rel="nofollow noreferrer">hopes</a> of integrating it in a <a href="http://www.lua.org/" rel="nofollow noreferrer">Lua</a> kernel, but it proved really hard to keep with the existing implementation. Still, it might interest you.</p>
 

Querying!

 
Guidance

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload