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.
Overview
Syllabus
- Unit 1: An Introduction to Memory Ordering and Atomic Operations
- Running Memory Ordering in Action
- Complete Memory Ordering Exercise
- Ensuring Sequential Consistency
- Master Memory Ordering Techniques
- Unit 2: Introduction to Lock-Free Stack
- Experience Lock-Free Stack in Action
- Complete the Lock-Free Stack
- Building a Lock-Free Book Stack
- Mastering Lock-Free Gadget Stacks
- Unit 3: Introduction to Lock-free Queue
- Exploring Lock-Free Queue Execution
- Implement the LockFreeQueue Push Method
- Implement Pop Method for Lock-Free Queue
- Building a Lock-Free Queue
- Unit 4: Applying Memory Model to Lock-Free Data Structures
- 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
Reviews
5.0 rating, based on 2 Class Central reviews
Showing Class Central Sort
-
well explained
and we have a chance to learn by a example codes from basic level to .
it explained that easy
-
I found this course to be very engaging and informative. The instructor did an excellent job breaking down complex concepts into simple, easy-to-follow lessons. The examples and case studies made the content feel practical and relevant, which really helped me apply what I learned.
While the course is strong overall, I think it could benefit from additional interactive elements, such as more quizzes or group discussions, to reinforce learning. That said, I would definitely recommend it to learners who want to build confidence in [topic] and gain practical knowledge they can apply immediately.”