Archive for category: ALS

My ALS Journey (22/n): Call for Collaboration

April 11, 2025

Today, I have a special call for collaboration. >> My ALS Journey so far << My Challenge …

My ALS Journey (21/n): ALS Fundraiser by Jen and Jason

March 12, 2025

Today, I want to present you something special. >> My ALS Journey so far << ALS Fundraiser…

My ALS Journey (20/n): Aids

February 9, 2025

Today, I would like to introduce all the important aids that allow me and Beatrix to get through the…

My ALS Journey (19/n): The Never Ending Story

January 4, 2025

Today, I present a sad story, and I can only take it by humor. >> My ALS Journey so far << My…

Last Chance- 1 Day Left

December 23, 2024

Make the Difference Let's do something great together: From December 1st to 24th, when you book…

Christmas Special – 5 Days Left

December 19, 2024

Make the Difference Let's do something great together: From December 1st to 24th, when you book…

Christmas Special – 7 Days Left

December 17, 2024

Make the Difference Let's do something great together: From December 1st to 24th, when you book…

My ALS Journey (18/n): C++ and ALS

December 16, 2024

Christmas Promotion Let’s do something great together: From December 1st to 24th, when…

Christmas Special

December 1, 2024

Make the Difference Let's do something great together: From December 1st to 24th, when you book…

My ALS Journey (17/n): Christmas Special

November 20, 2024

Today, I have a special Christmas gift. >> My ALS Journey so far << Make the…

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