latency

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.

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.

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.

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.

Kaze Emanuar explains how he rewrote and optimized the Super Mario 64 source code so it runs far faster on real N64 hardware. He covers performance bottlenecks and fixes in detail for his ROM hacks.

Wes Bos breaks down the techniques behind the McMaster-Carr website's speed: server-rendered HTML, prefetching, CDN and service worker caching, preloading, critical CSS and fixed-size images. He also notes its old-school jQuery and YUI JavaScript.

Matthias Wandel tests old and new code on a range of PCs, including a new mini PC, to measure how much faster modern hardware really is. He also shows optimization techniques such as branchless code, with benchmark programs on GitHub.

A walkthrough of the Quake III fast inverse square root, explaining where the constant 0x5f3759df comes from. It covers IEEE 754 floats, the bit hack that approximates a logarithm, and a Newton's method refinement.

Kaze Emanuar searches for the best sine approximation for the Nintendo 64, comparing the lookup tables in Mario 64 and Ocarina of Time with polynomial alternatives. It walks through numerics and 3rd, 4th and 5th order approximations.

Tom 7 (suckerpinch) delivers a long, comedic digression on gradient descent and floating-point imprecision. He shows how rounding behavior can supply the nonlinearity needed to build a neural network.

Matt Parker follows the community effort to speed up his slow Wordle-solving code, which ended up running hundreds of millions of times faster. He walks through the techniques contributors used.