Главная
Study mode:
on
1
Intro
2
Background
3
Cache model
4
Valgrind
5
Cache Simulator
6
Cache miss analysis
7
Timer structure
8
Perfstats
9
Linear Array
10
Binary Search
11
Map
12
Map performance
13
Cancellation
14
Heaps
15
B Heap
Description:
Explore the concept of "cache friendliness" in data structures and algorithms through this comprehensive conference talk from code::dive 2019. Delve into the importance of cache memory in modern CPUs and its impact on performance. Learn about the properties of cache memory, including its speed advantages and size limitations. Discover how to analyze cache efficiency, improve data structure layout in memory, and optimize access patterns for better performance. Gain insights into writing fast software by default and techniques for further improvements. Follow along as the speaker, Björn Fahller, an experienced software architect and programmer, demonstrates tools for analyzing cache efficiency and provides practical examples of problematic constructions and their better alternatives. Develop an intuition for creating high-performance software while covering topics such as linear arrays, binary search, map performance, cancellation, heaps, and B-heaps.

What Do You Mean by "Cache Friendly"?

code::dive conference
Add to list
0:00 / 0:00