Blog

timeline

ABA – A is not the same as A

June 9, 2017

/

A common problem in concurrency is the so-called ABA problem. That means you read a value twice and each…

RainerGrimmSmall

Which pdf bundle should I provide? Make your cross!

June 7, 2017

/

Now, it's time to choose the next pdf bundle? You will get all posts, all source files, and a cmake file…

BlockingNonBlocking

Blocking and Non-Blocking Algorithms

June 2, 2017

/

Blocking, non-blocking, lock-free, and wait-free. Each of these terms describes a key characteristic…

cover

Looking for Proofreaders for my new Book: Concurrency with Modern C++

May 27, 2017

/

I'm looking for proofreaders for my new book. I'll give you a detailed insight into the current and the…

breakingInvariant

Malicious Race Conditions and Data Races

May 22, 2017

/

This post is about malicious race conditions and data races. Malicious race conditions are race conditions…

account

Race Conditions versus Data Races

May 14, 2017

/

Race conditions and data races are related but different concepts. Because they are related, they are…

C++17: Improved Associative Containers and Uniform Container Access

May 7, 2017

/

C++11 has eight associative containers. With C++17, you can more comfortably insert new elements into…

timeline

C++17: New Parallel Algorithms of the Standard Template Library

May 1, 2017

/

The idea is quite simple. The Standard Template (STL) has more than 100 algorithms for searching, counting,…

RainerGrimmSmall

Get the Current Pdf Bundle: Concurrency with C++17 and C++20

April 26, 2017

/

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

timeline

C++17 has a Visitor

April 23, 2017

/

What have std::optional, std::any, and std::variant in common? You can construct them in place. But that…

RainerGrimmSmall

The Winners of the Next Pdf Bundles

April 20, 2017

/

The winners of the next pdf bundles are. [En]: Concurrency with C++17 and C++20[De]: Funktionale…

timeline

C++17 – Avoid Copying with std::string_view

April 16, 2017

/

The purpose of std::string_view is to avoid copying data already owned by someone else and of which only…

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 […]