Archive for month: July, 2016

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…

poll

100 Posts Anniversary – Quo vadis Modernes C++?

July 13, 2016

/

As you may know, I translate in this blog the posts from my German blog into English. My German blog…

trans

Transitivity of the Acquire-Release Semantic

July 12, 2016

/

A release operation synchronizes with an acquire operation on the same atomic variable and establishes,…

acquireReleaseConsume

memory_order_consume

July 9, 2016

/

std::memory_order_consume is the most legendary of the six memory models. That's for two reasons. On…

criticalRegion

Acquire-Release Semantic

July 4, 2016

/

With the acquire-release semantics, the memory model gets very thrilling. Because now, we do not have…

producerConsumer

Sequential Consistency applied

July 2, 2016

/

I have introduced In the post Sequential Consistency the default memory model. This model, in which all…

Latest news

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 […]
A Lock-Free Stack: A Simplified ImplementationFebruary 3, 2025 - 10:37 am
Today, I continue my mini story about lock-free data structures. General Considerations From the outside, the caller’s responsibility (application) is to protect the data. From inside, the data structure is responsible for protecting itself. A data structure that protects itself so a data race cannot appear is called thread-safe. First, what general considerations must you […]