YoVDO

What Do You Mean by "Cache Friendly"?

Offered By: code::dive conference via YouTube

Tags

Code::Dive Courses Software Development Courses Binary Search Courses Algorithms Courses Data Structures Courses Performance Tuning Courses Heaps Courses Valgrind Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.

Syllabus

Intro
Background
Cache model
Valgrind
Cache Simulator
Cache miss analysis
Timer structure
Perfstats
Linear Array
Binary Search
Map
Map performance
Cancellation
Heaps
B Heap


Taught by

code::dive conference

Related Courses

算法基础 | Fundamental Algorithms
Peking University via edX
Algorithms for Searching, Sorting, and Indexing
University of Colorado Boulder via Coursera
Introduction to Search Techniques in Python: Binary Search
Coursera Project Network via Coursera
Основы олимпиадного программирования
Saint Petersburg State University via Coursera
Algorithms in JavaScript
egghead.io