Blog

timeSinceEpoch

Time Duration

September 20, 2016

/

Time duration is the difference between two time points. It will be measured in time ticks. Time…

timepoint

Time Point

September 17, 2016

/

The starting point (epoch) and the additional time duration define the time point. It consists of two…

ZeitPunktDauerGeberEng

The Time Library

September 14, 2016

/

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

SingleThreadedAdditionEng

My Conclusion: Summation of a Vector in three Variants

September 11, 2016

/

After I've calculated in three different ways the sum of a std::vector I want to draw my conclusions. The…

localVariable

Multithreaded: Summation with Minimal Synchronization

September 7, 2016

/

Until now, I've used two strategies to summate a std::vector. First, I did the whole math in one thread…

synchronizeWithLock

Multithreaded: Summation of a Vector

September 5, 2016

/

My goal is to sum up all elements of a vector. I used in the last post a single thread. In this post,…

CalculateWithLoop

Single Threaded: Summation of a Vector

September 3, 2016

/

What is the fastest way to add the elements of a std::vector? This a question that I will pursue in the…

gcc

Thread-Safe Initialization of a Singleton

August 23, 2016

/

There are a lot of issues with the singleton pattern. I'm aware of that. But the singleton pattern is…

sukzessiveOptimierungRelaxedSemantikEng

Ongoing Optimization: Relaxed Semantics with CppMem

August 20, 2016

/

With the relaxed semantics, we have no synchronizations and ordering constraints on atomic operations. Relaxed…

undefinedEng

Ongoing Optimization: A Data Race with CppMem

August 18, 2016

/

But we can improve and further improve the acquire-release semantics of the last post. Why should x be…

sukzessiveOptimierungSequenzielleKonsistenzEng

Ongoing Optimization: Acquire-Release Semantics with CppMem

August 16, 2016

/

With the acquire-release semantics, we break the sequential consistency. In the acquire-release semantics,…

sukzessiveOptimierungSequenzielleKonsistenzEng

Ongoing Optimization: Sequential Consistency with CppMem

August 13, 2016

/

With atomic data types, you can tailor your program to your needs and optimize it. But now we are in…

Latest news

The Problem with C++ Safety (Part 1): Why “It Works” Isn’t Good EnoughOctober 18, 2026 - 1:58 pm
Rainer Grimm’s blog continues. In this first article of a new series, Klaus Iglberger looks at why C++ is called memory unsafe and argues that the real problem isn’t the language itself, but how we write and teach it.
Small Safety Improvements in the C++ 26 Core LanguageSeptember 22, 2025 - 10:16 am
Safety is an important concern in C++26. Contracts are probably the most important feature for safety. But C++26 has much more to offer. Today, I would like to introduce three small but important improvements in C++26 that solve typical safety issues in C++. Disallow binding a returned reference to a temporary A safety issue can be […]
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 […]