Blog

timeline

C++17: New Parallel Algorithms of the Standard Template Library

May 1, 2017

/

The idea is quite simple. The Standard Template (STL) has more than 100 algorithms for searching, counting,…

RainerGrimmSmall

Get the Current Pdf Bundle: Concurrency with C++17 and C++20

April 26, 2017

/

I have prepared the pdf bundle. To get it is quite simple. If you subscribe to the newsletter,…

timeline

C++17 has a Visitor

April 23, 2017

/

What have std::optional, std::any, and std::variant in common? You can construct them in place. But that…

RainerGrimmSmall

The Winners of the Next Pdf Bundles

April 20, 2017

/

The winners of the next pdf bundles are. [En]: Concurrency with C++17 and C++20[De]: Funktionale…

timeline

C++17 – Avoid Copying with std::string_view

April 16, 2017

/

The purpose of std::string_view is to avoid copying data already owned by someone else and of which only…

RainerGrimmSmall

Which pdf bundle should I provide?

April 12, 2017

/

Now, it's time to choose the next pdf bundle? You will get all posts, all source files, and a cmake file…

timeline

C++17- std::byte and std::filesystem

April 10, 2017

/

My post, C++17 - What's New in the Library, was fine for the first overview. Today, I will look deeper…

timeline

C++17- More Details about the Core Language

April 4, 2017

/

After I provided the big picture of the new C++17 core language in my post "C++17 - What's New in the…

timeline

C++17 – What’s New in the Library?

March 31, 2017

/

What's new in the library? A lot. To make the long story short. We get a std::string_view, parallel algorithm…

RainerGrimmSmall

How to get your pdf bundle?

March 28, 2017

/

Now, I have prepared the pdf bundle to the C++ memory model/ Das C++ Speichermodell. To get it is quite…

timeline

C++17 – What’s New in the Core Language?

March 24, 2017

/

C++11, C++14, and C++17. I guess you see the pattern. Later this year, we will get a new C++ standard.…

RainerGrimmSmall

And the Winners are: The C++ Memory Model/Das C++ Speichermodell

March 21, 2017

/

That is easy. Both of you, the German and the English reader prefer the same pdf bundle: The C+ Memory…

Latest news

Data-Parallel Types – A First ExampleJune 25, 2025 - 4:01 pm
After providing a theoretical introduction to the new C++ 26 feature in my last article, “Data-Parallel Types (SIMD),” I would like to follow up today with a practical example. The following introductory example is from the experimental implementation of the SIMD library. This functionality has been fully adopted in the C++ 26 draft under the […]
Data-Parallel Types (SIMD)June 16, 2025 - 10:24 am
The data-parallel types (SIMD) library provides data-parallel types and operations on them. Today, I want to take a closer look at this. Before diving into the new library, I would like to take a moment to discuss SIMD. SIMD Vectorization refers to the SIMD (Single Instruction, Multiple Data) extensions of a modern processor’s instruction set. […]
Read-copy-update (RCU)June 2, 2025 - 9:54 am
Read-copy-update is strong in multithreading environments where a data structure is read almost exclusively but rarely written. First of all, what is RCU? The excellent Wikipedia page on Read-copy-update provides a good introduction: In computer science, read-copy-update (RCU) is a synchronization mechanism that avoids the use of lock primitives while multiple threads concurrently read and […]
atomic<shared_ptr<>> by Oliver SchädlichMay 19, 2025 - 9:11 am
This blog article is an experiment. A few days ago, I received the following email (translated from German) from Oliver Schädlich (oliver.schaedlich@gmail.com). If, as I hope, this article sparks a discussion, I will be happy to summarize it in my last article. Please send an email to: Rainer.Grimm@ModernesCpp.de. I just read your latest article on […]
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 […]