We talk about how to detect if your program is spending a lot of time in kernel mode (system mode) and investigate ways to speed them up.
“Premature optimization is the root of all evil”. Or is it?
We investigate the topic of premature optimizations, or more specifically, in what cases you want to think early about performance.
Flexibility and Performance
In this post we talk about how to write code that is both flexible and fast!
Speedscope: visualize what your program is doing and where it is spending time
In this post we introduce Speescope, a useful tool to help you visualize what your program is doing and where it is spending time.
Speeding up an Image Processing Algorithm
A post explaining how a few small changes in the right places can have a drastic effects on performance of an image processing algorithm named Canny.
The true price of virtual functions in C++
We talk about virtual functions, and how the performance of software with virtual functions depends on many factors: the cost of additional instructions, cache misses, branch prediction misses, instruction cache misses and compiler optimizations.
2-minute read: Class Size, Member Layout and Speed
We are exploring how class size and layout of its data members affect your program’s speed
Performance Tuning Contest: February 2021 edition
Take part in a performance tuning contest to learn more about performance tuning on a real world code.
Crash course introduction to parallelism: SIMD Parallelism
This is the first article about hardware support for parallelization. We talk about SIMD, an extension almost every processor nowadays has that lets you speed up your program.
2-minute read: How is Big O notation relevant on modern systems?
Big O notation is commonly used to describe algorithm performance. But modern hardware makes performance analysis much harder than it used to be. In this short article we give three interesting examples to illustrate the limits of big O notation.