Blog

undefinedEng

Ongoing Optimization: A Data Race with CppMem

August 18, 2016

/

But we can improve and further improve the acquire-release semantics of the last post. Why should x be…

sukzessiveOptimierungSequenzielleKonsistenzEng

Ongoing Optimization: Acquire-Release Semantics with CppMem

August 16, 2016

/

With the acquire-release semantics, we break the sequential consistency. In the acquire-release semantics,…

sukzessiveOptimierungSequenzielleKonsistenzEng

Ongoing Optimization: Sequential Consistency with CppMem

August 13, 2016

/

With atomic data types, you can tailor your program to your needs and optimize it. But now we are in…

sukzessiveOptimierungLocksEng

Ongoing Optimization: Locks and Volatile with CppMem

August 9, 2016

/

The easiest way to solve the undefined behaviour in the post Ongoing Optimization: Unsynchronized access…

KurzUndGutStandardbibliothek

Looking for Proofreaders for my New C++ Book

August 4, 2016

/

Something completely different. I'm looking for English proofreaders for my new book. O'Reilly gave…

ongoingOptimization

Ongoing Optimization

August 3, 2016

/

Now it's time to put the theory into practice. The job is relatively easy. A small program should undergo…

undefinedEng

Ongoing Optimization: Unsynchronized Access with CppMem

August 3, 2016

/

I described my challenge in the last post. Let's 's start with our process of ongoing optimization. To…

CppMemUeberblickNumbers

CppMem – An Overview

July 30, 2016

/

CppMem is an interactive tool for exploring the behavior of small code snippets of the C++ memory model.…

relaxed

Relaxed Semantics

July 27, 2016

/

The relaxed semantics is the end of the scale. The relaxed semantic is the weakest of all memory models…

acquireOperation

Acquire-Release Fences

July 21, 2016

/

Acquire and release fences guarantee similar synchronization and ordering constraints as atomics with…

FullFence

Fences are Memory Barriers

July 19, 2016

/

The key idea of a std::atomic_thread_fence is to establish synchronization and ordering constraints between…

acquireReleaseWithWaiting

Acquire-Release Semantics – The Typical Misunderstanding

July 16, 2016

/

A release operation synchronizes-with an acquire operation on the same atomic variable. So we can easily…

Latest news

Hazard Pointers in C++26May 5, 2025 - 11:12 am
Hazard pointers provide garbage collection in C++ and solve the ABA problem. First of all. What is a hazard pointer? Proposal P2530R3 gives a nice explanation: A hazard pointer is a single-writer multi-reader pointer that can be owned by at most one thread at any time. Only the owner of the hazard pointer can set […]
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 […]