Archive for year: 2023

Broker

Broker

April 11, 2023

/

The Broker Pattern structures distributed software systems that interact with remote service invocations.…

Lack of Training Culture: Why the Cultureless Don’t Stand a Chance

April 6, 2023

/

Last Monday, I published an article on Heise, "Mangel an Fortbildung: Warum die Kulturlosen keine Chance…

PipesAndFilter

Pipes-and-Filters

April 2, 2023

/

The Pipes-and-Filters architecture pattern describes the structure of systems that process data streams. The…

Layers

Layers

March 26, 2023

/

The layers pattern splits a task into horizontal layers. Each layer has a specific responsibility and…

Table of Content

March 22, 2023

/

This page is the starting point for my blog Modernes C++. A simple overview of my existing posts. This…

The Time Library

March 22, 2023

/

A blog dealing with multithreading in modern C++ but not writing about the new time library is incomplete.…

Multithreading with C++17 and C++20

March 22, 2023

/

Forecasts about the future are difficult. In particular, when they are about C++20. Nevertheless, I…

Multithreading in Modern C++

March 22, 2023

/

With the new C++11 Standard, C++ faces the first time challenges of multicore architectures. The…

cover

Printed Version of “The C++ Standard Library” on Amazon

March 21, 2023

/

I have two great news. First, you have my "The C++ Standard Library" on Amazon; second, the book…

Layers

Architectural Patterns

March 19, 2023

/

Architectural patterns describe the fundamental structure of a software system and are often based on…

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