Archive for category: Blog

Contracts: Evaluation Semantic

September 8, 2025

After briefly presenting the details of contracts in my last article, “Contracts: A Deep Dive", I…

Contracts: A Deep Dive

August 25, 2025

I already introduced contracts in the article “Contracts in C++26”. In this article and the next…

Data-Parallel Types: Algorithms

August 11, 2025

The data-parallel types library has four special algorithms for SIMD vectors. The four special…

Data-Parallel Types: Reduction

July 28, 2025

In this article, I will discuss reduction and mask reduction for data-parallel types. Reduction A…

Data-Parallel Types: simd_mask

July 14, 2025

Thanks to simd_mask, conditional execution of operations on data-parallel types is possible. Unfortunately,…

Data-Parallel Types – A First Example

June 25, 2025

After providing a theoretical introduction to the new C++ 26 feature in my last article, “Data-Parallel…

Data-Parallel Types (SIMD)

June 16, 2025

The data-parallel types (SIMD) library provides data-parallel types and operations on them. Today, I…

Read-copy-update (RCU)

June 2, 2025

Read-copy-update is strong in multithreading environments where a data structure is read almost exclusively…

atomic<shared_ptr<>> by Oliver Schädlich

May 19, 2025

This blog article is an experiment. A few days ago, I received the following email (translated from…

Hazard Pointers in C++26

May 5, 2025

Hazard pointers provide garbage collection in C++ and solve the ABA problem. First of all. What…

Latest news

Contracts: Evaluation SemanticSeptember 8, 2025 - 9:49 am
After briefly presenting the details of contracts in my last article, “Contracts: A Deep Dive“, I would like to take a closer look at the very interesting Evaluation Semantic in today’s article. If a contract assertion occurs, one of the four evaluation semantics is applied: ignore, observe, enforce, or quick-enforce. The table provides an overview […]
Contracts: A Deep DiveAugust 25, 2025 - 9:35 am
I already introduced contracts in the article “Contracts in C++26”. In this article and the next ones, I will dive deeper into the details. In this article, I refer mainly to the excellent proposal “Contracts for C++”. Unfortunately, proposal P2900R14 exceeds 100 pages in length. I will therefore try to summarize the most important points […]
Data-Parallel Types: AlgorithmsAugust 11, 2025 - 8:45 am
The data-parallel types library has four special algorithms for SIMD vectors. The four special algorithms are min, max, minmax, and clamp. min, max, and minmax The two algorithms min and max have in common that they each accept two SIMD vectors and return a SIMD vector. This contains the element-wise minimum or maximum of the […]
Data-Parallel Types: ReductionJuly 28, 2025 - 10:10 am
In this article, I will discuss reduction and mask reduction for data-parallel types. Reduction A reduction reduces the SIMD vector to a single element. The library provides three functions for this purpose: reduce, hmin, and hmax.The following program shows how these functions are used. // reduction.cpp #include <array> #include <experimental/simd> #include <functional> #include <iostream> #include […]
Data-Parallel Types: simd_maskJuly 14, 2025 - 9:16 am
Thanks to simd_mask, conditional execution of operations on data-parallel types is possible. Unfortunately, in my last article, Data-Parallel Types – A First Example, I forgot to introduce one of the new library functions. I will make up for that in this article. Where Expression The new keyword where creates a so-called where expression. This allows […]
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 […]