Archive for month: July, 2021

templatesInstantiation

Template Instantiation

July 29, 2021

/

Template instantiation is creating a concrete function or a concrete class out of a function or class…

roth cleancpp20 cover

And the Winners for the Five Vouchers for Stephan’s Book “Clean C++20” are

July 28, 2021

/

I'm happy to present the five winners in this post including their answers. I was happy…

timelineParallelSTL

Performance of the Parallel STL Algorithms

July 22, 2021

/

In my last post, "Parallel Algorithms of the STL with the GCC Compiler", I presented the necessary theory…

timelineParallelSTL

Parallel Algorithms of the STL with the GCC Compiler

July 16, 2021

/

GCC supports my favorite C++17 feature: the Standard Template Library (STL) parallel algorithms. I recognized…

roth cleancpp20 cover

Five Vouchers for Stephan Roth’s Book “Clean C++20” to Win

July 13, 2021

/

I give away five vouchers for Stephan Roth's book "Clean C++20", sponsored by the book's publisher Apress. There…

TemplateSpecialization

Full Specialization of Function Templates

July 9, 2021

/

As you may know from my previous post, Template Specialization, a function template can only be full…

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