Blog

StaticDynamic

More about Dynamic and Static Polymorphism

February 25, 2022

/

In my last post, "Dynamic and Static Polymorphism", I introduced dynamic polymorphism. Today, I continue…

An illustration of the dining philosophers problem

More About Me

February 23, 2022

/

Do you want to participate in my mentoring program "Fundamentals for C++ Professionals"? Of course, you…

StaticDynamic

Dynamic and Static Polymorphism

February 18, 2022

/

Polymorphism is the property that different types support the same interface. In C++, we distinguish…

constexprIf

constexpr if

February 7, 2022

/

In today's post, I want to introduce an exciting C++17 feature: constexpr if. constexpr if enables it…

constexpr

constexpr and consteval Functions in C++20

February 4, 2022

/

With C++20, constexpr became way more powerful. Additionally, we have consteval functions in C++20…

RainerTalk

More Information about my Mentoring Program “Fundamentals for C++ Professionals”

February 4, 2022

/

One month ago, I presented "My Mentoring Program "Fundamentals for C++ Professionals". I'm overwhelmed…

constexpr

constexpr Functions

January 26, 2022

/

Today, I continue my story about programming at compile time. After template metaprogramming, the type-traits…

ConcurrencyCoverFrame

An Update of my Book “Concurrency with Modern C++”

January 20, 2022

/

I am happy to announce. I updated my "Concurrency with Modern C++". This update includes a rework…

bundle

The New pdf Bundle is Ready: C++20 Concurreny – The Hidden Pearls

January 12, 2022

/

I have prepared the pdf bundle. To get it is quite simple. If you subscribe to the newsletter,…

An illustration of the dining philosophers problem

Dining Philosophers Problem III

January 8, 2022

/

This post ends the mini-series about the dining philosophers problem by Andre Adrian. Today, he applies…

An illustration of the dining philosophers problem

Dining Philosophers Problem II

January 8, 2022

/

In the last post "Dining Philosophers Problem I", Andre Adrian started his analysis of the classical…

An illustration of the dining philosophers problem

Dining Philosophers Problem I

January 7, 2022

/

At Christmas time, I had a few nice discussions with Andre Adrian. He solved the classical dining philosopher's…

Latest news

Hazard Pointers in C++26May 5, 2025 - 11:12 am
Hazard pointers provide garbage collection in C++ and solve the ABA problem. First of all. What is a hazard pointer? Proposal P2530R3 gives a nice explanation: A hazard pointer is a single-writer multi-reader pointer that can be owned by at most one thread at any time. Only the owner of the hazard pointer can set […]
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 […]