Archive for month: March, 2017

timeline

C++17 – What’s New in the Library?

March 31, 2017

/

What's new in the library? A lot. To make the long story short. We get a std::string_view, parallel algorithm…

RainerGrimmSmall

How to get your pdf bundle?

March 28, 2017

/

Now, I have prepared the pdf bundle to the C++ memory model/ Das C++ Speichermodell. To get it is quite…

timeline

C++17 – What’s New in the Core Language?

March 24, 2017

/

C++11, C++14, and C++17. I guess you see the pattern. Later this year, we will get a new C++ standard.…

RainerGrimmSmall

And the Winners are: The C++ Memory Model/Das C++ Speichermodell

March 21, 2017

/

That is easy. Both of you, the German and the English reader prefer the same pdf bundle: The C+ Memory…

conceptsDefinition

Defining Concepts

March 17, 2017

/

I wrote a few posts about using concepts. Concepts are a named set of requirements. Let's define a few…

conceptsIntegralVariations

Placeholders – The Second

March 11, 2017

/

The unification of templates, concepts, and placeholders goes on. This time, I will look closely at constrained…

slice

Concepts – Placeholders

March 5, 2017

/

C++11 has auto unconstrained placeholders. You can use concepts in C++20 as constrained placeholders.…

ForkJoin

Task Blocks

March 3, 2017

/

Task blocks use the well-known fork-join paradigm for the parallel execution of tasks. Who invented…

synchronized

Transactional Memory

March 1, 2017

/

Transactional memory is based on the idea of a transaction from the database theory. Transactional memory…

RainerGrimmSmall

I’m Done – Geschafft: Words about the Future of my Blogs

March 1, 2017

/

I'm more than happy to say. I'm done with translating my more the 130 posts from http://www.grimm-jaud.de/index.php/blog…

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