Latency Numbers Explorer
MDN Reference
In storage engineering, hardware mechanical sympathy begins with understanding the physical orders of magnitude separating CPU registers from magnetic disks and remote network hops.
The Storage Latency Hierarchyโ
In modern computer architecture, memory and storage media form a strict hierarchy governed by the trade-off between access speed, cost per gigabyte, and volatility.
graph TD
A["CPU Registers (0.5 ns)"] --> B["L1 / L2 / L3 Cache (1 - 20 ns)"]
B --> C["Main Memory / DRAM (50 - 100 ns)"]
C --> D["CXL / Persistent Memory (150 - 300 ns)"]
D --> E["NVMe SSD / PCIe 4.0 / 5.0 (10 - 25 ยตs)"]
E --> F["SATA SSD (150 ยตs)"]
F --> G["Mechanical HDD (10 ms)"]
G --> H["Cold Tape Archive (> seconds to minutes)"]
Key Engineering Takeawaysโ
- The DRAM to SSD Chasm: Accessing RAM (~100 ns) is 100x faster than fetching a 4KB block from a cutting-edge NVMe SSD (~10 ยตs), and 100,000x faster than a rotational HDD seek (~10 ms).
- Sequential vs Random I/O: Sequential access allows hardware controllers to trigger hardware prefetching, saturate PCIe lanes, and pipeline requests, outperforming random small I/O by orders of magnitude even on solid-state media.
- Network vs Disk Paradox: On modern optical 100 GbE datacenter networks with RDMA (Remote Direct Memory Access), reading memory on a remote server (~5-10 ยตs) can be faster than issuing a random read to a local SATA SSD (~150 ยตs).