Using Moody Camel s Implementation to parallelize code execution - Javier Abud

Lock-free queues, while longstanding in multi-threaded programming, still present an underutilized potential for high-performance operations, bypassing the drawbacks associated with semaphores and mutexes, the traditional locking methods.

This talk provides a hands-on introduction to a battle tested lock-free queue in C++ – Moody Camel's lock-free queue. Participants will be guided through its usage, highlighting key methods for queuing and bulk operations. Building on this knowledge, the presentation will further demonstrate a real-world application: optimizing directory enumeration. Whether you're familiar with concurrency in C++ or new to the concept, this session aims to offer valuable insights into an efficient, lock-free data structure and its practical applications.