Archive for category: ALS

My ALS Journey: 5/n

January 31, 2024

As always, I'm pretty busy. I have given C++ classes, created a new mentoring program, and finished…

My ALS Journey: 4/n

January 18, 2024

In the last three weeks, a lot happened. I was in the ALS-Ambulanz in Ulm and started a money-raising…

Our Money-Raising Campaign for ALS Research

January 13, 2024

Get my 3-book bundle Modern C++ Collection for half the price ($70 -> $35). I will donate the money…

My ALS Journey: 3/n

December 28, 2023

Here is what happened in the last three weeks. Let me start with a very thoughtful Christmas present. Brief…

My ALS Journey: 2/n

December 6, 2023

As promised, here is what happened in the last three weeks. Let me start with the more pleasing things. Classes,…

Thank You for Your Support: 1/n

November 17, 2023

After I wrote about my ALS illness in my post "My very Serious Progressive Nerve Condition", I decided…

My very Serious Progressive Nerve Condition

October 29, 2023

I am sorry to inform you that I have ALS, a very serious progressive nerve condition. Therefore, I am…

Latest news

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 […]
My Next Mentoring Program: “Generic Programming (Templates) with C++” startsFebruary 4, 2025 - 4:51 pm
My next mentoring program, “Embedded Programming with Modern C++,” starts on January 31st. Registration is open. Here are more details. Embedded Programming with Modern C++ The mentoring program consists of 16 stations. You have to invest at least 3 hours per week for each one. This means the program takes four months, and you can […]