Lockfree Programming Part 2 - Data Structures

Dive into advanced lockfree programming techniques and data structures in this comprehensive conference talk from CppNow. Begin with a recap of fundamental concepts before exploring complex topics such as reordering code, cache coherency, and multi-thread memory ordering. Examine the intricacies of lockfree data structures, starting with a simple stack and its associated ABA problems. Progress to various lockfree queue implementations, including circular queues, and gain insights into atomic operations and memory ordering. Learn about the Kaz Loop and BDWAZ techniques for improving lockfree algorithms. Enhance your understanding of concurrent programming with practical examples and in-depth explanations of key concepts in lockfree data structure design and implementation.

Recap
Reordering code
Scope of everything
Publications
Operations
Cache Coherency
MultiThread Memory Ordering
Kaz Loop
Lockfree Stack
ABAB
DWAZ
Circular Queue
Single Threaded Circular Queue
Atomic
Memory Ordering
Circular Queues