All images and fonts placed here to

preload them into the browser cache

Nexa Text Regular

Nexa Text Bold

Nexa Text Italic

Nexa Text Bold Italic

Nexa Regular

Nexa Bold

Nexa  Italic

Nexa Bold Italic

#include <random_code>
using in_cpp;
to preload() {
// the monospace
font as = well;
}
All images and fonts placed here to preload them into the browser cache Nexa Text Regular Nexa Text Bold Nexa Text Italic Nexa Text Bold Italic Nexa Regular Nexa Bold Nexa  Italic Nexa Bold Italic # include <random_code> using in_cpp; to preload () { // the monospace font as = well; }

Your Performance Todo List: The Most Important Performance Opportunities and Pitfalls to Remember About

By Jan Bielak

Your Performance Todo List: The Most Important Performance Opportunities and Pitfalls to Remember About

This is the interactive slide deck for my CppCon 2022 talk. Writing efficient programs is hard. This is because it requires a lot of knowledge, experience and strategic thinking. There have been many talks on optimization and often each addresses a single concept. Being able to achieve a bird’s eye view of factors affecting performance often requires many hours of researching the topic. To lessen the mental burden of optimizing programs, I have picked out the techniques, I believe are most important. During the talk, I will present them in an organized manner and provide practical examples of how they can be applied. I will first discuss what I believe are the main goals efficient programs strive to achieve. Then, I will present the general methods of achieving those goals. Then, for the majority of the talk, we will discuss a few dozen performance opportunities. For each of them, I will explain the underlying mechanism of how the optimisation works. I will avoid bluntly giving guidelines to follow without explanation. Each of the techniques naturally comes with its costs, and those will be discussed as well. I will additionally discuss various performance pitfalls. These are sometimes called “premature pessimisations” in contrast to the often used term of “premature optimizations”. I will show examples of optimizations which do not incur any cost on program readability or ma

  • 1,888