Lock-Free Concurrent Data Structures
This course focuses on lock-free data structures in C++. It covers atomic operations, memory ordering, and lock-free algorithms. Students will learn how to implement and use lock-free data structures like queues, stacks, maps, and sets, as well as understand the benefits and challenges of lock-free programming.
Lessons and practices
Running Memory Ordering in Action
Complete Memory Ordering Exercise
Ensuring Sequential Consistency
Master Memory Ordering Techniques
Experience Lock-Free Stack in Action
Complete the Lock-Free Stack
Building a Lock-Free Book Stack
Mastering Lock-Free Gadget Stacks
Exploring Lock-Free Queue Execution
Implement the LockFreeQueue Push Method
Implement Pop Method for Lock-Free Queue
Building a Lock-Free Queue
Exploring Lock-Free Stack Operations
Applying Memory Ordering to Lock-free Queue
Complete the Lock-Free Stack Code
Mastering Lock-Free Queue Operations
Mastering Lock-Free Stack Operations
Interested in this course? Learn and practice with Cosmo!
Practice is how you turn knowledge into actual skills.