LPC 2012 > RCU Judy Arrays : cache-efficient, compact, fast and scalable trie

0 %
Loading Click here to add:
Add to notification list

My favorites With attachments Unanswered New My annotations
Reset filters
Get notified of changes by email

In the past year, the RCU lock-free hash table hash 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 from Judy Arrays.

 

Topic Lead: Mathieu Desnoyers
Mathieu Desnoyers main contributions are in the area of tracing (monitoring/performance analysis/debugging) and scalability, both at the kernel and user-space levels. He is maintainer of the LTTng project and the Userspace RCU library. He works in close collaboration with the telecommunication industry, many Linux distributions, and with customers developing hardware scaling from small embedded devices to large-deployment servers. He is CEO and Senior Software Architect at EfficiOS.

https://blueprints.launchpad.net/lpc/+spec/lpc2012-scale-rcu-scalable-trie