Recently, lightweight threads have gained significant popularity in C++, with libraries such as Userver, Argobots, and Boost:fibers leading the way. However, using traditional concurrency primitives like mutexes or locks with these lightweight threads can pose challenges.

For instance, consider a scenario involving a lock that employs active waiting techniques, such as a test-and-set lock. When a thread yields and suspends while in a critical section, all currently active lightweight threads can attempt to acquire the lock without suspending themselves. This behavior can result in deadlock, as the active threads will never be able to acquire the lock since the suspended thread cannot release it.

Due to these challenges, existing lock implementations need to be updated to function correctly in environments with lightweight threads. In this talk, we will explore various approaches to transforming state-of-the-art locks. These new implementations will support all libraries that utilize lightweight threading capabilities and provide a specific interface. To demonstrate the versatility of our approach, we will present experiments using three lightweight thread libraries: Userver, Argobots, and Boost:fibers.

Abstracts will be here soon.

Abstracts will be here soon.

The talk covers probabilistic data structures, focusing on how they work and their real-world applications, from bloom filter to hyperloglog. The case studies will include use cases from HFT, deduplication, unique object counting, and latency assessment.

Abstracts will be here soon.

Abstracts will be here soon.

Abstracts will be here soon.