Archive for category: Mentoring

My Next Mentoring Program: “Generic Programming (Templates) with C++” starts

February 4, 2025

/

My next mentoring program, "Embedded Programming with Modern C++," starts on January 31st. Registration…

My Next Mentoring Program: ” Embedded Programming with Modern C++” starts

January 2, 2025

/

My next mentoring program, "Embedded Programming with Modern C++," starts on January 31st. Registration…

My Next Mentoring Program: “Concurrency with Modern C++” starts

March 11, 2024

/

My next mentoring program, "Concurrency with Modern C++", starts on the 15th of March. Registration is…

Presentation of my Mentoring Programs (Including “Concurrency with Modern C++”)

February 9, 2024

/

My Next Mentoring Program: “Concurrency with Modern C++”

February 6, 2024

/

My next mentoring program, "Concurrency with Modern C++", starts on the 15th of March. Registration is…

Two Days Left: Early Bird Price for my Mentoring Program “C++20: Get the Details”

August 9, 2023

/

1 Week Left: Early Bird Price for my Mentoring Program “C++20: Get the Details”

August 5, 2023

/

Presentation of my Mentoring Programs (Including “C++20: Get the Details”)

July 31, 2023

/

2 Weeks Left: Early Bird Price for my Mentoring Program “C++20: Get the Details”

July 29, 2023

/

30 Days Left: Early Bird Price for my Mentoring Program “C++20: Get the Details”

July 20, 2023

/

Latest news

A Lock-Free Stack: A Hazard Pointer Implementation Explained IIApril 7, 2025 - 11:11 am
In my last post, I started to explain a hazard pointer implementation: A Lock-Free Stack: A Hazard Pointer Implementation Explained I. Today, I will continue to explain the implementation. The Retire List The retire list has the public member functions isInUse, addNode, and deleteUnusedNodes. Additionally, it has the inner class RetireNode, an atomic member of […]
A Lock-Free Stack: A Hazard Pointer Implementation Explained IMarch 24, 2025 - 11:37 am
In my last post, I presented a hazard pointer implementation: A Lock-Free Stack: A Hazard Pointer Implementation. Today, I will explain the implementation. MyNode is a class template, parametrized by the type it holds: data. MyNode models the concept Node. template <typename T> concept Node = requires(T a) { {T::data}; { *a.next } -> std::same_as<T&>; […]
A Lock-Free Stack: A Hazard Pointer ImplementationMarch 10, 2025 - 11:42 am
Hazard Pointers solve all issues of the previous implementation: A Lock-Free Stack: A Simple Garbage Collector. From one Week to two Weeks You may have already noticed. I will change my blog publishing frequency from one to two weeks in the future. Writing a post using your voice is exceptionally exhausting and time-consuming. Hazard Pointers […]
A Lock-Free Stack: A Simple Garbage CollectorFebruary 24, 2025 - 11:58 am
My next lock-free stack includes a simple garbage collector. I discussed the concurrent execution of more than one topAndPush call is a Race Condition. I can safely delete a node if not more than one topAndPush call is executing concurrently. This observation is crucial for solving this memory leak issue: I store removed nodes on […]
A Lock-Free Stack: Atomic Smart PointerFebruary 17, 2025 - 11:47 am
The easiest way to solve this memory leak issue from the last post is to use a std::shared_ptr. Atomic Smart Pointer There are two ways to apply atomic operations on a std::shared_ptr: In C++11, you can use the free atomic functions on std::shared_ptr. With C++20, you can use atomic smart pointers. C++11 Using atomic operations […]
A Lock-Free Stack: A Complete ImplementationFebruary 10, 2025 - 3:01 pm
My last lock-free stack implementation was incomplete. It only supported push operations. Let’s change this. The following paragraph about sequential consistency is optional. You can easily ignore it. Sequential Consistency In my examples, I use the default memory ordering: sequential consistency. The reason is simple. Sequential consistency provides the strongest guarantees of all memory ordering […]