Archive for category: C++20

C++20 Modules: Private Module Fragment and Header Units

September 2, 2021

/

In the last weeks, I learned something new about modules in C++20: private modules fragments and header…

Automatically Resuming a Job with Coroutines on a Separate Thread

March 9, 2021

/

In my last post "Starting Jobs with Coroutines", I applied co_await to start a job. In this post, I improve…

Starting Jobs with Coroutines

March 7, 2021

/

C++20 has three new keywords to make a coroutine out of a function: co_return, co_yield, and co_await.…

A Generic Data Stream with Coroutines in C++20

March 7, 2021

/

In my last post in this mini-series on coroutines from the practical perspective, I presented the workflow…

An Infinite Data Stream with Coroutines in C++20

March 6, 2021

/

In this post, I analyze the new keyword co_yield. Thanks to co_yield, you can create an infinite data…

Executing a Future in a Separate Thread with Coroutines

March 6, 2021

/

This post concludes my posts about co_return in C++20. I started with an eager future, and continued…

Lazy Futures with Coroutines

March 4, 2021

/

Based on the coroutines-based implementation of a simple future in my last post "Implementing Simple…

Implementing Simple Futures with Coroutines

February 22, 2021

/

Instead of return, a coroutine uses co_return returning its result. In this post, I want to implement…

TimelineCpp20

Synchronized Output Streams with C++20

February 18, 2021

/

What happens when you write without synchronization to std::cout? You get a mess. With C++20, this should…

TimelineCpp20

An Improved Thread with C++20

February 12, 2021

/

std::jthread stands for joining thread. In addition to std::thread (C++11), std::jthread automatically…

Latest news

A Lock-Free Stack: A Hazard Pointer ImplementationMarch 10, 2025 - 11:42 am
Hazard Pointers solve all issues of the previous implementation: A Lock-Free Stack: A Simple Garbage Collector. From one Week to two Weeks You may have already noticed. I will change my blog publishing frequency from one to two weeks in the future. Writing a post using your voice is exceptionally exhausting and time-consuming. Hazard Pointers […]
A Lock-Free Stack: A Simple Garbage CollectorFebruary 24, 2025 - 11:58 am
My next lock-free stack includes a simple garbage collector. I discussed the concurrent execution of more than one topAndPush call is a Race Condition. I can safely delete a node if not more than one topAndPush call is executing concurrently. This observation is crucial for solving this memory leak issue: I store removed nodes on […]
A Lock-Free Stack: Atomic Smart PointerFebruary 17, 2025 - 11:47 am
The easiest way to solve this memory leak issue from the last post is to use a std::shared_ptr. Atomic Smart Pointer There are two ways to apply atomic operations on a std::shared_ptr: In C++11, you can use the free atomic functions on std::shared_ptr. With C++20, you can use atomic smart pointers. C++11 Using atomic operations […]
A Lock-Free Stack: A Complete ImplementationFebruary 10, 2025 - 3:01 pm
My last lock-free stack implementation was incomplete. It only supported push operations. Let’s change this. The following paragraph about sequential consistency is optional. You can easily ignore it. Sequential Consistency In my examples, I use the default memory ordering: sequential consistency. The reason is simple. Sequential consistency provides the strongest guarantees of all memory ordering […]
My Next Mentoring Program: “Generic Programming (Templates) with C++” startsFebruary 4, 2025 - 4:51 pm
My next mentoring program, “Embedded Programming with Modern C++,” starts on January 31st. Registration is open. Here are more details. Embedded Programming with Modern C++ The mentoring program consists of 16 stations. You have to invest at least 3 hours per week for each one. This means the program takes four months, and you can […]
A Lock-Free Stack: A Simplified ImplementationFebruary 3, 2025 - 10:37 am
Today, I continue my mini story about lock-free data structures. General Considerations From the outside, the caller’s responsibility (application) is to protect the data. From inside, the data structure is responsible for protecting itself. A data structure that protects itself so a data race cannot appear is called thread-safe. First, what general considerations must you […]