Archive for year: 2023

Monitor Object

June 26, 2023

/

The monitor object design pattern synchronizes concurrent member function execution to ensure that only…

ConcurrencyPatterns

Active Object

June 18, 2023

/

The active object design pattern decouples method execution from method invocation for objects that each…

DealingWithMutation

Dealing with Mutation: Guarded Suspension

May 29, 2023

/

Guarded Suspension applies a unique strategy to deal with mutation. It signals when it is done with…

DealingWithMutation

Dealing with Mutation: Thread-Safe Interface

May 22, 2023

/

I continue my journey with concurrency patterns in today's post. The Thread-Safe Interface fits very…

DealingWithMutation

Dealing with Mutation: Locking

May 15, 2023

/

Locking is a classical way to protect a shared, mutable state. Today, I will present the two variants,…

Sharing

Dealing with Sharing

May 8, 2023

/

If you don’t share, no data races can happen. Not sharing means that your thread works on local variables.…

ConcurrencyPatterns

Concurrency Patterns

April 30, 2023

/

There are many well-established patterns used in the concurrency domain. They deal with synchronization…

My Next Mentoring Program: “C++20: Get the Details”

April 27, 2023

/

My next mentoring program, "C++20: Get the Details", starts in July. Registration will open in June. Here…

Reactor

Reactor

April 23, 2023

/

Event-driven applications, such as GUIs or servers, often apply the architecture pattern Reactor. A Reactor…

Model-View-Controller

April 17, 2023

/

The Model-View-Controller (MVC) is one of the classic architectural patterns from the book "Pattern-Oriented…

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