Andrew Fribush
fig. 1.3.1 · the famous latencies, drawn to scale for once.
1ns101001µs101001ms101001sL1 cache reference1 nsBranch mispredict3 nsL2 cache reference4 nsMutex lock / unlock17 nsMain memory reference100 nsCompress 1 KB (Snappy)2 µsRead 1 MB from memory3 µsSSD random read16 µsRead 1 MB from SSD49 µsRound trip in datacenter500 µsRead 1 MB from spinning disk825 µsDisk seek2 msCA → Amsterdam → CA packet150 msIF THE L1 REFERENCE TOOK ONE SECOND, THE PACKET WOULD TAKE 4.8 YEARS.2020S VALUES · DEAN / NORVIG, VIA COLIN SCOTT · LOG SCALE, EACH GRIDLINE ×10

source: Dean/Norvig constants, 2020s values · latency.data.ts · colin-scott.github.io†

View in context: Charts → · All figures

Andrew Fribush, software and computer engineer in Austin. I build consequential systems where software meets institutions: finance, healthcare, commerce, government data, and the mechanisms that govern AI agents. Taking new engagements: hello@andrewfribush.com.