Archive for year: 2018

RainerGrimmSmall

Which pdf bundle should I provide? Make your choice!

July 8, 2018

/

Now, it's time to choose the next pdf bundle? You will get all posts, all source files, and a cmake file…

padlock

C++ Core Guidelines: The Remaining Rules about Lock-Free Programming

July 6, 2018

/

Today, I will finish my story on concurrency and lock-free programming. There are four rules to lock-free…

park 748339 1280

C++ Core Guidelines: The Resolution of the Riddle

June 27, 2018

/

Today, I will solve the riddle from my last post. Thanks to my readers, the analysis of the ABA problem…

fear cat

C++ Core Guidelines: Concurrency and lock-free Programming

June 19, 2018

/

Today, I will finish the rules for concurrency and continue directly with lock-free programming. Yes,…

technology 2025795 1280

The End of my Detour: Unified Futures

June 15, 2018

/

After the last post to executors, I can finally write about the unified futures. I write in the post…

cover

The Update of my Book “Concurreny with Modern C++”

June 12, 2018

/

The update of my book "Concurrency with Modern C++" is available. This version is a total rework of the…

timeline20 23

A Short Detour: Executors

June 8, 2018

/

A few weeks ago, one of the authors of the proposal to the futures in C++ Felix Petriconi wrote me an…

trapMice

C++ Core Guidelines: Be Aware of the Traps of Condition Variables

June 1, 2018

/

Today, I am writing a scary post about condition variables. You should be aware of these issues of condition…

trap

C++ Core Guidelines: More Traps in the Concurrency

May 24, 2018

/

Concurrency provides many ways to shoot yourself in the foot. The rules for today help you to know these…

gleise

C++ Core Guidelines: Taking Care of your Child Thread

May 18, 2018

/

When you create a new child thread, you must answer an important question: should you wait for the child…

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