HackerTube.dev

code::dive conference 2014 - Scott Meyers: Cpu Caches and Why You Care

NOKIA Technology Center Wrocław · 231K views · 2015-01-05 · 1:16:58

Open on YouTube ↗

If playback is restricted in your region, try opening the original video. Use Mark watched to add it to your marked videos.

Overview

Scott Meyers explains how CPU caches work and why they matter for performance, covering cache levels, access speeds, associativity, and effects in multithreaded code. The focus is C++ and cache-aware, data-oriented programming.

On Hacker News

HN points to it as the go-to explanation of why memory layout beats pointer-chasing structures on real hardware.

Recommended by 3 HN people across 3 months · HN mentions 2018–2023

Topics

Search by tags

What people said

drainyard · 2018-10 · Strong recommendation

Two of my favorites: code::dive conference 2014 - Scott Meyers: Cpu Caches and Why You Care: [VIDEO] CppCon 2014: Mike Acton "Data-Oriented Design and C++": [LINK] They're mostly about C++ and cache aware/data oriented programming.

Read the original HN comment ↗
coppsilgold · 2023-04 · Recommendation

Cache associativity, conflict miss. You have too many memory addresses mapping to the same cache lines all being used together at the same time. Scott Meyers had a very good talk which contained this information: < [VIDEO] >

Read the original HN comment ↗
jimmy1 · 2018-04 · Recommendation

Here is a good visualization on access speeds for each level of cache, then main memory. Now take the main memory access time and essentially double it (for your state of the art SSD's today) and that's the access speed. [VIDEO]

Read the original HN comment ↗

Sources

Video by NOKIA Technology Center Wrocław, played through YouTube.

Data and selection notes

HN summaries and labels may contain AI errors. HN dates refer to discussions, not video publication.

HN Library: HackerTube export (2026-10-31) and open-index/hacker-news. Upstream summaries and classifications may contain AI errors.

Views, duration and playback status refresh separately from the published catalog. When an update fails, existing data remains visible.

Selection checks
  • SaaS & AI candidates: Topic keywords do not match
  • Editor-approved picks: Editorial review is required

Rule matches identify candidates. They do not guarantee video quality or financial results.

About the library and its sources