C++ Algorithmic Complexity, Data Locality, Parallelism, Compiler Optimizations, & Some Concurrency

---

Algorithmic Complexity, Data Locality, Parallelism, and Compiler Optimizations, Seasoned with Some Concurrency - A Deep Dive into C++ Performance - Avi Lachmish - CppCon 2022

In C++, efficiency is usually the name of the game, so what can we do to make sure we are ahead of the game?

In this talk, we will focus on the selection of algorithms and data structures and analyze their effect on program performance.

We will discuss the importance of data locality, proper data structures, and using the stack vs. heap for our runtime efficiency.

Taking into consideration tradeoffs such as space complexity vs. time complexity and setup-time vs. run-time.
We will present benchmarks that would widen our perspective on those considerations.

Concurrency and parallelism will also be added to the mixture, making sure to conclude also for a multithreaded environment.
---

Avi Lachmish

Avi is an expert in Web and networking technologies, operating systems, and software development methodologies. Avi has extensive experience in C++, object-oriented analysis, design and distributed architectures.
---

#cppcon #programming #cpp

[mytech]

I find a large amount of information on cache behavior on the read side, but I would like to hear more about the behavior of multilevel cache on the write-store side of the cpu. When is the new data availible to reuse in the same core or a different core on the same package, is there any need to wait for the line of data to flush to main memory before reading it from shared cache, is it purely in L1d or simultaneously copied to L2 L3?

[stormingbob]

where can i find the slides for this talk? they are not present in the github