Archive for year: 2024

Reflection in C++26

September 23, 2024

After the search into the breadth starts today, the search into the depth: reflection. Reflection Reflection…

An Overview of C++26: Concurrency

September 16, 2024

Today, I will finish my overview of C++26 and write about concurrency. There are still two library…

My ALS Journey (14/n): My Status Quo

September 11, 2024

My ALS progression seems to slow down, and Beatrix and I can the first time plan for the future. >>…

An Overview Of C++26: The Library – Math

September 9, 2024

The most interesting feature of the new C++26 standard library is its improved math support. std::submdspan std::submdspan…

An Overview of C++26: The Library

September 2, 2024

In my last post, I overviewed C++26's core language. Today, I continue with the library. To make…

An Overview of C++26: Core Language

August 26, 2024

C++26 has a lot to offer. Let me directly jump in and give you an overview. This image gives…

C++26: The Next C++ Standard

August 19, 2024

/

C++26 will be the next C++ standard after C++23. This new standard significantly improves C++ and is…

My ALS Journey (13/n): Next Steps

August 13, 2024

Ice Bucket Challenge The Ice Bucket Challenge, sometimes called the ALS Ice Bucket Challenge,…

Table of Content

August 12, 2024

/

C++23: This and That

August 12, 2024

I have already written 10 posts about C++23. Today, I want to discuss the features I forgot in the first…

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