Archive for category: ALS

My ALS Journey (15/n): A typical Day

October 8, 2024

You may wonder how my day looks. Let me compare a day before ALS with a current day >> My ALS Journey…

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. >>…

My ALS Journey (13/n): Next Steps

August 13, 2024

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

My ALS Journey (12/n): My Legacy

July 25, 2024

Today, I want to give you a rough idea, how I plan my next year's as a teacher, mentor , and speaker. >>…

My ALS Journey: 11/n

June 29, 2024

This update is a special one. I want to explain how I can still provide classes, mentoring, and presentations. >>…

My ALS Journey: 10/n

June 10, 2024

Wow! This is already my 10 status report. >> My ALS Journey so far << How I write…

My ALS Journey: 9/n with Hector

April 29, 2024

I initially thought that this status report was not particularly exciting. I was very wrong, but read…

My ALS Journey: 8/n with Easter Present

March 30, 2024

I'm happy to announce the second money-raising campaign for ALS research. This time, I'm proud to say…

My ALS Journey: 7/n

March 2, 2024

Today, I write about my journey in chronological order. Visit from Jens On Wednesday, the…

My ALS Journey: 6/n

February 14, 2024

Here is the next step in my journey. This one is optimistic. CppCast, C++Online, and AMA In…

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