We investigate the unusual way memory subsystem interacts with branch prediction and how this interaction shapes software performance.
All posts tagged branch prediction
The memory subsystem from the viewpoint of software: how memory subsystem affects software performance 2/3
We continue the investigation from the previous post, trying to measure how the memory subsystem affects software performance. We write small programs (kernels) to quantify the effects of cache line, memory latency, TLB cache, cache conflicts, vectorization and branch prediction.
Why is quicksort faster than heapsort? And how to make them faster?
We try to answer the question of why is quicksort faster than heapsort and then we dig deeper into these algorithms’ hardware efficiency. The goal: making them faster.
How branches influence the performance of your code and what can you do about it?
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.