Archive for month: October, 2019

TimelineCpp20Concurrency

C++20: Concurrency

October 29, 2019

/

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

TimelineCpp20Libraries

C++20: The Library

October 28, 2019

/

My last post "C++20: The Core Language" presented the new features of the C++20 core language. Today,…

TimelineCpp20Core

C++ 20: The Core Language

October 27, 2019

/

My last post C++20: The Big Four started with an overview of concepts, ranges, coroutines, and modules.…

TimelineCpp20BigFourUpdate

C++20: The Big Four

October 23, 2019

/

This post presents you the big four: concepts, ranges, coroutines, and modules. C++20 has a lot…

RainerGrimmSmall

The new pdf bundle is ready: C++ Core Guidelines: Performance

October 23, 2019

/

I have prepared the pdf bundle. To get it is quite simple. If you subscribe to the newsletter, you…

TimelineCpp

The Next Big Thing: C++20

October 17, 2019

/

C++20 will be the next big C++ standard after C++11. As C++11 did, C++20 will change the way we program…

ConcurrencyCoverFrame

“Concurrency with Modern C++” has a new chapter

October 15, 2019

/

I'm happy to announce. I added a new chapter to lock-based concurrent data structures…

mistake 968334 1280

C++ Core Guidelines: Naming and Layout Rules

October 10, 2019

/

The C++ core guidelines have about twenty naming and layout rules. A few of them are obvious; a few of…

cemetery

C++ Core Guidelines: Lifetime Safety And Checking the Rules

October 1, 2019

/

The lifetime safety profile in the C++ core guidelines boils down to one issue: don't dereference a possible…

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