Blog

perfectForwarding1

Perfect Forwarding

December 24, 2016

/

Today, we solve " ... a herefore unsolved problem in C++" (Bjarne Stroustrup). To make the long story…

RainerGrimmSmall

Time for Wishes

December 24, 2016

/

I wrote more than 130 posts in my German blog about functional programming, embedded programming and…

moveAlgorithm

Move Semantis: Two Nice Properties

December 22, 2016

/

I will talk about two nice properties of the move semantic in this post that is not so often mentioned.…

copy

Copy versus Move Semantics: A few Numbers

December 20, 2016

/

A lot was written about the advantages of move semantics to copy semantics. Instead of an expensive copy…

sizeof

std::array – Dynamic Memory, no Thanks

December 18, 2016

/

std::array combines the best of two worlds. On the one hand, std::array has the size and efficiency of…

stringAndVector

Automatic Memory Management of the STL Containers

December 16, 2016

/

One of the significant advantages of a C++ string to a C string and of a std::vector to a C array is…

weakPtr

std::weak_ptr

December 14, 2016

/

std::unique_ptr models the concept of exclusive ownership, std::shared_ptr the concept of shared ownership.…

enabledShared

Specialities of std::shared_ptr

December 12, 2016

/

After I draw the big picture of a std::shared_ptr in the last post, I want to present two special aspects…

sharedPtr

std::shared_ptr

December 11, 2016

/

std::shared_ptr's share the resource. The shared reference counter counts the number of owners. Copying…

uniquePtr

std::unique_ptr

December 9, 2016

/

According to the RAII idiom, a std::unique_ptr manages automatically and exclusively the lifetime of…

comparisonEng

Memory and Performance Overhead of Smart Pointers

December 6, 2016

/

C++11 offers four different smart pointers. I will have a closer look in this post regarding memory and…

RessourcenmanagementEng

Careful Handling of Resources

December 5, 2016

/

The careful handling of resources - may it be, for example, memory, files, or sockets - is a key concern…

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