LPC2012 Scaling: RCU Judy Arrays: cache-efficient, compact, fast and scalable trie

In the past year, the RCU lock-free hash table has been polished and made production-ready within the Userspace RCU project. It performs and scales really well for updates, key lookups and traversals in no particular key order, but does not fulfill ordered key traversal use-cases. This talk is presenting ongoing work on an ordered data structure that supports RCU reads: a cache-efficient, compact, fast, and scalable trie, inspired by Judy Arrays.

Back to blog