Archive for category: Blog

RainerGrimmSmall

Source Code Repository

May 5, 2016

/

I created a repository for the source code. It's on GitHub and has the name ModernesCppSource:https://github.com/RainerGrimm/ModernesCppSource.git This…

bossWorker

Threads Sharing Data

April 30, 2016

/

One of the biggest challenges of thread management begins when the threads share non-const data Data…

Sleeper

Thread Arguments

April 26, 2016

/

A thread gets its data by copy or by reference. By default, you should use by copy. Why? In case your…

threadForgetJoin

Threads Lifetime

April 24, 2016

/

The parent has to take care of their child. This simple idea has big consequences for a thread lifetime.…

RainerGrimmSmall

For the Proofreaders and the Curious People

April 23, 2016

/

After a lot of discussion with my proofreaders, we finally have a process to publish the articles. How…

createThread

Thread Creation

April 19, 2016

/

Thread creation is easy. Call std::thread, and a new thread will be created. The thread gets a…

timeline

Multithreading in Modern C++

April 18, 2016

/

With the new C++11 Standard, C++ faces the first-time challenges of multicore architectures. The…

RainerGrimmSmall

Why my Blog in English?

April 17, 2016

/

For half a year I have a blog about modern C++: Modernes C++. Although 80% of the readers are used to…

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