Tag Archive for: Memory

Posts

Table of Content

March 22, 2023

/

Optimization with Allocators in C++17

October 9, 2023

Thanks to polymorphic allocators in C++17, you can optimize your memory allocation. This optimization…

Special Allocators with C++17

October 2, 2023

I introduced in my last post "Polymorphic Allocators with C++17" the theory of polymorphic allocators…

Polymorphic Allocators in C++17

September 25, 2023

This post starts a miniseries about an almost unknown feature in C++17: polymorphic allocators. I often…

relay race

C++ Core Guidelines: Passing Smart Pointers

December 23, 2017

/

Passing smart pointers is a critical topic that is seldom addressed. This ends with the C++ core guidelines…

gold 513062 640

C++ Core Guidelines: Rules for Smart Pointers

December 15, 2017

/

There were a lot of C++ experts who said that smart pointers were the essential feature of C++11. Today,…

German Monopoly board in the middle of a game

C++ Core Guidelines: Rules for Allocating and Deallocating

December 8, 2017

/

The guidelines have six rules for explicit memory allocation and deallocation. Six! Maybe you are surprised…

photo montage 1548599 640

C++ Core Guidelines: Rules about Resource Management

December 1, 2017

/

This and the following posts will probably be about the most critical concern in programming: resource…

Memory Pool Allocators by Jonathan Müller

January 9, 2017

/

After I have written a few posts about memory management in C++, I'm very glad to present Jonathan Müller,…

VergleichSpeicherstrategienEng

Pros and Cons of the various Memory Allocation Strategies

January 7, 2017

/

In C++ you have the choice between various memory allocation strategies. In addition to the frequently…

Strategies for the Allocation of Memory

January 5, 2017

/

There are a lot of different strategies for allocating memory. Programming languages like Python or Java…

Latest news

An Advanced Priority Scheduler for CoroutinesDecember 4, 2023 - 9:24 pm
Today, I use the straightforward scheduler from the post “A Priority Scheduler for Coroutines” and improve its priority handling. This is the fourth post in my miniseries about schedulers for C++ coroutines. The first two posts were guest posts by Dian-Lun Lin: Dian-Lun’s schedulers were based on the container adaptor std::stack and std::queue. The std::stack […]
A Priority Scheduler for CoroutinesNovember 27, 2023 - 12:49 pm
In this post, I will extend the straightforward scheduler from Dian-Lun with priorities. This is the third post in my mini-series about schedulers for C++ coroutines. The first two posts were guest posts by Dian-Lun Lin: Dian-Lun’s schedulers were based on the container adaptor std::stack and std::queue. The std::stack schedules its tasks according to its […]
Coroutines: A Scheduler for Tasks by Dian-Lun LinNovember 20, 2023 - 10:44 am
The last post “A Concise Introduction to Coroutines by Dian-Lun Lin” provide the theory. Today, Dian-Lun presents his single-threaded scheduler for C++ coroutines. This post assumes you are familiar with the previous post “A Concise Introduction to Coroutines by Dian-Lun Lin“. A Single-threaded Scheduler for C++ Coroutines In this section, I implement a single-threaded scheduler […]
A Concise Introduction to Coroutines by Dian-Lun LinNovember 13, 2023 - 11:11 am
Today, I will start a miniseries about a scheduler for tasks. The starting point of this miniseries is a straightforward scheduler by Dian-Lun Lin that becomes increasingly sophisticated. I have already written around 15 posts about coroutines. They explain the theory about coroutines and apply this theory in various ways. However, I still fight for […]
The Ranges Library in C++20: More Design ChoicesNovember 6, 2023 - 8:27 am
The ranges library in C++20 made due to performance reasons a few unique design choices. These choices have consequences: cache issues and constness issues. Here is a short reminder. In my last post, “The Ranges Libray in C++20: Design Choices“, I presented this possible implementation of std::ranges::filter_view: if constexpr (!ranges::forward_range<V>) return /* iterator */{*this, ranges::find_if(base_, […]
The Ranges Library in C++20: Design ChoicesOctober 30, 2023 - 9:15 am
Thanks to the ranges library, working with the Standard Template Library (STL) is much more comfortable and powerful. First of all, the algorithms of the ranges library are lazy, can work directly on the container, and can be composed. Additionally, the ranges library made a few unique design choices, you must know. Before I dive […]