Hover the eight tiers of the storage pyramid for speed, capacity and cost per gigabyte, then walk a byte up from disk to register and watch the latency add up.
A pyramid of the eight places a computer can keep a byte, fastest and smallest at the top, slowest and largest at the bottom: CPU registers, L1, L2 and L3 cache, RAM, SSD, HDD, and optical disc or tape.
Hover a tier (or tab to it and press Enter) and the panel beside the pyramid fills in with that tier’s access time, how much of it a machine typically has, what a gigabyte of it costs, whether it keeps your data when the power goes, and what it is physically made of.
Click a tier to park a byte there. Then drag the Journey slider — or press Play the climb — and watch that byte copied up through every tier above it, paying each one’s latency on the way, because a tier can only read from the tier directly below it. The callouts fire as it passes each tier and the running total builds underneath.
Read the IF 1 NS = 1 S figure as you go: it is the same wait with one nanosecond stretched to one second, which is the only way these numbers become imaginable. And watch what happens to the total at the end of a climb from the HDD or the tape — almost all of it is the first hop. That is the whole reason caches exist.
Every figure here is an order-of-magnitude approximation, written with a “~” or a range on it. Real parts vary; the size of the steps between tiers does not.
TechKnowSurge builds IT and cybersecurity professionals through hands-on, concept-first training built around real understanding — not memorization. Free interactive tools, structured programs, and 25+ years of real-world experience, all in one place.
Explore free tools and programs →