latency

Gil Tene of Azul Systems explains common pitfalls in measuring latency and response time, including why averages mislead and the problem of coordinated omission. He introduces open source tools like HdrHistogram for better measurement and reporting.

Rick Hudson's GopherCon 2015 talk on Go 1.5's new low-latency concurrent garbage collector. It covers the motivation, performance numbers, technical challenges and why the approach fits Go.

A short visualization from HotNets researchers of routing and latency over SpaceX's proposed Starlink constellation, based on its FCC filings. It shows orbital shells, link topology and how inter-satellite routes could beat terrestrial fiber on long distances.

Redis Labs and Tim Davis present RedisGraph, which uses GraphBLAS to treat graph queries in Cypher as sparse linear algebra for lower latency.

A Google I/O 2013 talk by Android audio engineers on why reliable, low-latency audio is hard on the platform. It covers problem areas across the stack, platform work underway and techniques apps can use.

John Carmack's keynote at Oculus Connect 2014 about the Gear VR and development stories from building it. He discusses mobile GPU optimization, latency, and display ideas like programmable interlacing.

A two-minute 2008 clip from Sun's Fishworks team in which Brendan Gregg uses DTrace to show disk latency spiking while he shouts at a rack of drives. Bryan Cantrill narrates the demonstration.

Optiver's Carl Cook explains how to build high-frequency trading systems in C++, where the critical path runs rarely but must be extremely fast. He covers techniques for low and predictable latency, including avoiding main memory and cache misses.

John Carmack speaks at UMKC's 2017 commencement event about the difficulties of VR, especially end-to-end latency across hardware and software. He covers why latency and buffering matter and how nausea is addressed.

Mark Handley of UCL explains, with simulation visualizations, how early Starlink satellites without inter-satellite links could still give low-latency wide-area communication by hopping via ground relays. He shows it can beat fibre on many long paths.

Ilya Grigorik of Google's Make the Web Fast team explains how to build a mobile site that appears on screen within one second. He covers the network and rendering constraints on mobile.

Gor Nishanov's CppCon 2018 talk on using tiny C++ coroutines to hide memory latency, interleaving useful work while prefetches bring cache lines in from main memory.

Admiral Grace Hopper holds up a length of wire to show how far light travels in a nanosecond, about 11.8 inches. She explains how she made the idea concrete to people who could not picture a billionth of a second.

Mark Handley of UCL looks at how SpaceX's November 2018 revisions to the Starlink constellation affect network behavior. The video visualizes the orbits and routing and estimates latencies, building on his earlier video and research paper.

A Microsoft Research demo from TechFest 2012 of a lab touch system that lets viewers feel the effect of different input latencies, down to about 1 ms. It shows how much more responsive dragging feels compared with typical 100 ms touch delay.

Zach Tellman's Clojure West talk covers the basics of queueing theory and its practical use in systems, including backpressure, how queues break down under load, and pitfalls of naive core.async use.

Casey Muratori captures CygnusEd Professional running on an Amiga 2000, showing how smoothly it scrolled text. He notes the real effect is better on a period CRT.

A short demo showing slow 2D drawing in the Windows 7 GUI compared with XP. It attributes the slowdown to the display driver model lacking hardware accelerated GDI.

Real Engineering explains why SpaceX is building Starlink, including the economics of satellite internet. It covers the latency advantage of light in vacuum over fiber for long-distance links.

Full recording of Elon Musk's January 2015 presentation and Q&A at the SpaceX Seattle office announcement. He lays out plans for a satellite constellation to provide low-latency global internet, tied to funding Mars ambitions. Pauses between questions have been edited out.

A short demo of typing on the Modos Paper Monitor, an open e-ink monitor, using 4-level grayscale to show low latency.

A Swedish fiber provider's short experiment in which volunteers wear Oculus Rift headsets that add lag to their view of real life. They try to do everyday tasks like making pancakes.

Giant Bomb interviews John Carmack at E3 2012 about his virtual reality head-mounted display prototype. He demos it and talks about latency, depth and focus problems in VR.

Grace Hopper appears on Letterman and uses a foot-long piece of wire to show how far light travels in a nanosecond.

A lecture by Commodore Grace Hopper on the future of computing, posted by MIT Lincoln Laboratory. It includes her well-known nanosecond wire demonstration and humorous comparisons of device latencies.

Tom Scott visits IEX, a stock exchange that slows down trading with a long coil of fiber. The coil removes the speed advantage of high-frequency traders.

The original 2012 screencast introducing Meteor, a JavaScript framework for building web apps quickly. It demonstrates realtime updates, latency compensation and low boilerplate.

Armin Ronacher, creator of Flask, explains how CPython's internals and C API leak into the language's semantics. Using examples like the complexity of the add operation, he shows why Python is hard to optimize or reimplement.

Andrei Alexandrescu's CppCon 2015 talk argues that std::allocator is badly designed. He proposes building high-performance allocators from small composable, templated pieces.

A DevGAMM talk by Jonathan Blow arguing that civilizations can lose technological capability and that software quality is already deteriorating. He discusses how knowledge fails to transfer between generations.

Emery Berger explains why performance is hard to measure and deliver on modern hardware, showing how code layout and alignment can swamp optimization effects. He presents Stabilizer for statistically sound evaluation and Coz, a causal profiler.

Casey Muratori's long talk arguing that modern software has ballooned to tens of millions of lines because of hardware and OS diversity. He proposes a stable ISA for entire system-on-a-chip packages and recalls when games shipped with their own boot disk.

Matt Kulukundis explains how Google designed SwissTable, a fast, cache-friendly hash table, step by step from std::unordered_map. The talk covers open addressing, SIMD probing and the tradeoffs of changing a fundamental data structure.

Rick Reed of WhatsApp explains at Erlang Factory 2014 how the service scaled to billions of messages with a very small engineering team. He covers the FreeBSD and Erlang stack, Mnesia usage, server counts and bottleneck work.

In Ars Technica's War Stories, Naughty Dog co-founder Andy Gavin explains how the team squeezed Crash Bandicoot onto the original PlayStation. They overwrote Sony library code in RAM, built custom animation compression, and streamed assets around slow seek times.

Casey Muratori's first refterm lecture lays out philosophies of optimization, distinguishing optimization from non-pessimization, which means avoiding needless work. It uses his fast terminal renderer project to show how fast computers really are.

Mike Acton of Insomniac Games argues that a program's purpose is transforming data, and shows how common C++ approaches work against that in performance-critical game development. He covers cache behavior, data layout and the limits of compilers.

Jonathan Blow's DevGAMM 2019 talk argues that software knowledge is being lost between generations and that growing layers of abstraction could lead to a decline in technological civilization.

Casey Muratori's two-hour talk tracing the history of object-oriented programming back to the 1960s and examining how its ideas, and later entity component systems, came about. It is followed by a Q&A.

Chandler Carruth's CppCon 2014 talk on writing fast C++, explaining why data structure choice and memory layout matter more than clever algorithms. It covers why standard containers like unordered_map perform poorly on modern CPUs.