Archive for category: ALS

My ALS Journey (28/n): Bureaucracy – The German Disease

August 23, 2025

Today I want to write about a sad topic. Bureaucracy in the German healthcare system is becoming increasingly…

My ALS Journey (27/n): An Emergency Call

August 8, 2025

Unfortunately, I had an emergency call last Friday. That's why this article is appearing a little earlier…

My ALS Journey (26/n): Cippi’s first Adventures

July 27, 2025

Cippi went on her first big trip. First, she went to Belgium to visit Tom Tesch, and then she flew to…

My ALS Journey (25/n): Small and Big Hurdles

July 7, 2025

Today, I want to share with you some of my everyday problems. >> My ALS Journey so far << New…

My ALS Journey (24/n): Cippi’s World Tour

June 18, 2025

Many of you want to get in touch with Cippi. So here is a brief overview of her travel plans for 2025. >>…

My ALS Journey (23/n): Cippi

May 10, 2025

Let me introduce Cippi. I hope you like her. You probably already know her from my C++ books. >>…

My ALS Journey (22/n): Call for Collaboration

April 11, 2025

Today, I have a special call for collaboration. >> My ALS Journey so far << My Challenge …

My ALS Journey (21/n): ALS Fundraiser by Jen and Jason

March 12, 2025

Today, I want to present you something special. >> My ALS Journey so far << ALS Fundraiser…

My ALS Journey (20/n): Aids

February 9, 2025

Today, I would like to introduce all the important aids that allow me and Beatrix to get through the…

My ALS Journey (19/n): The Never Ending Story

January 4, 2025

Today, I present a sad story, and I can only take it by humor. >> My ALS Journey so far << My…

Latest news

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