Tag Archive for: semaphores

Posts

An illustration of the dining philosophers problem

Dining Philosophers Problem III

January 8, 2022

0 Comments

This post ends the mini-series about the dining philosophers problem by Andre Adrian. Today, he applies…

Semaphores in C++20

January 14, 2021

0 Comments

Semaphores are a synchronization mechanism used to control concurrent access to a shared resource. They…

C++20: Concurrency

October 29, 2019

0 Comments

This post concludes my overview of C++20. Today's post is about the concurrency features in the next…

Latest news

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