We investigate what is the best way to store polymorphic objects in a container for fast access
If your program uses dynamic memory, its speed will depend on allocation time but also on memory access time. Here we investigate how memory access time depends on the memory layout of your data structure. We also investigate ways to speed up your program by laying out your data structure optimally.
We talk about how to speed up your program if your program is taking time to allocate or release memory.
In this articles we investigate on how branches influence the performance of the code and what can we do to improve the speed of our branchfull code.
CPU dispatchingh is all about making your code portable and fast. We will talk about how to make your detect features your CPU has at is disposal and select the fastest function for that particular CPU without a need to recompile your software.
Function calls are not cheap operations and for time critical code it is better to avoid them. This article explores techniques you can use to avoid function calls thus speeding up your code.
Learn about FlameGraphs, a great tool that will help you quickly find slow functions in your program.
Traditional compilation-linking cycle generates binaries that work fine, but in case you need more speed, you need to learn about link time optimizations. Here we talk about what link time optimizations are, how to enable them and what improvements to expect.
We investigate how the data cache influences the performance of your program, talk about ways for you to write faster programs by better leveraging the data cache.