← all systems · see it in The System
Computer memory
The component that stores information, such as data and programs, for immediate use in the computer: instructions fetched by the processor and the data those instructions fetch and store, held in memory cells (today MOS semiconductor cells on integrated circuits, volatile DRAM and SRAM and non-volatile flash and ROM), grouped into words reached by binary addresses, arranged in a hierarchy from registers and caches through main memory to mass storage, and managed by the operating system through virtual memory and protection.
Properties published scienceour proposal
Sourced fields, and our own readings.
| aliases | Computer memory (the store the rule lives in) |
| born at | early 1940s (ENIAC's tube store; delay lines 1942-44); the first random-access store 1946-48; contested (C-2884) |
| born precision | about five years |
| boundary | Inside: the storage cells (DRAM capacitors and access transistors, SRAM flip-flops, flash floating gates; historically mercury delay lines, Williams-tube charge spots, magnetic cores), the arrays of rows and columns with their wordlines, bitlines, sense amplifiers and refresh, the chips and modules that group cells into addressable words, and the hierarchy of levels from processor registers and caches to main memory and mass storage. Outside: the processor that issues addresses and consumes words, the operating system that maps and protects memory, the programs whose instructions and data it holds, the power supply, the heat sink and air, the particles that pass through it, and the people who build, program and attack it. On the line: the memory controller and memory channel, the memory management unit and page tables (virtual memory), and error-correcting codes. |
| nested level | Built from MOS transistors and capacitors on integrated circuits (earlier mercury columns, cathode-ray tubes and ferrite rings), organised into cells, arrays, chips and modules, and those into a hierarchy; computer memory is a part of computer hardware and the store (M) of a computer. Programs, the stored program and software run on it (booked from their side as runsOn). |
| scale | technological |
Measures (38) published science
| characteristic clock: DRAM refresh interval | 64 or less (each row); one row every 7.8 us for 8,192 rows staggered ms |
| register access | 0.25 ns (1 cycle at 4.0 GHz); 18,432 bits per core |
| L1 data cache | 32 KiB; 1 ns (4 cycles); up to 64 GB/s |
| L2 cache | 1 MB; 3.5 ns (14 cycles) |
| L3 cache | 16-32 MB shared by 8 cores; 11.75 ns (47 cycles) |
| main memory (DDR5) | 64 GiB; about 60 GB/s; 82.5 ns |
| solid-state drive | 2 TB; 2000 MB/s; 0.2 ms |
| hard disk drive | 18 TB; 500 MB/s; 4.16 ms |
| spun-down disks (nearline) | petabytes; 25 s |
| tape library | exabytes; 160 MB/s; minutes |
| Atlas one-level store | 16,384 words core plus 98,304 words drum |
| delay-line capacity rule | capacity = recirculation time / time per bit; early systems a few thousand bits, recirculation in microseconds |
| EDSAC store | 256 35-bit words in 16 delay lines of 560 bits (later 512 words) |
| UNIVAC I average access time | about 222 us |
| speed of sound in mercury | 1450 (air 343.2) m/s |
| mercury line temperature | 40 C |
| core memory density and cost | about 32 kilobits per cubic foot by the late 1960s; about $1 to about 1 cent per bit bits/ft3; $/bit |
| electrons per flash cell | about 100 (1x-nm MLC) electrons |
| flash endurance | 150,000 (older SLC) to 3,000 (1x-nm MLC) P/E cycles |
| Landauer bound per erased bit | kB T ln 2, about 3e-21 at 300 K J |
| measured erasure heat, long cycles | 0.72 kB T (bound 0.693 kB T) |
| share of system energy spent moving data | 40% scientific, 35% mobile, 62% consumer |
| energy of a memory access against an addition | about 115 times ratio |
| DRAM share of system power | more than 40% in recent CPU or GPU systems; off-chip hierarchy 40-50% in 2003 IBM servers |
| memory capacity per core trend | falls about 30% every two years (cores double every two years, DRAM capacity every three) %/2 yr |
| DRAM latency change over 20 years | reduced by only 30% while capacity grew about 128x and bandwidth about 20x |
| refresh reduction with retention bins | 74.6% fewer refreshes; DRAM power -16.1%; performance +8.6% (8 cores, 32 GB) |
| RowHammer threshold | as few as 139K accesses; up to one in 1.7K cells susceptible |
| modules vulnerable to RowHammer | 110 of 129 (2008-2014 modules; all from 2012-2013) |
| DRAM error rate in the field | 25,000-70,000 per billion device hours per Mbit; over 8% of DIMMs per year FIT/Mbit |
| soft-error rate with altitude | neutron flux about 14 per cm2 per hour at New York sea level; x2.2 per 1000 m; mountains an order of magnitude higher; aircraft over 300x per cm2 h |
| alpha emission limit for packaging | under 0.001 (a shoe sole 0.1-10) counts per hour per cm2 |
| DRAM remanence when cooled | under 1% of bits decayed after 10 min unpowered at about -50 C |
| DRAM remanence in liquid nitrogen | 0.17% after 60 min at about -196 C |
| durability of conventional storage media | at most 50 years in optimal conditions |
| DNA storage theoretical density | petabytes per gram (usually unreachable) bytes/g |
| DRAM price per bit, 2017 | +47% (largest jump in 30 years); early 2026 increases some above 200% |
| address space | N address bits reach 2^N words |
Open contentions (4) open contention
Where sources or readings disagree. Both stay on the map.
- C-563 What causes most computer memory errors: cosmic rays or hardware faults?
booked: The map keeps both: cosmic-ray neutrons as a cause of random errors, and field data showing that hardware faults dominated in one large fleet.
the other reading: hard errors dominate (Schroeder 2009); cosmic rays the predominant cause of soft errors in modern devices (encyclopedia); neutrons the key to silent errors (Asorey 2022) - C-568 What was the first computer?
booked: The map names no single first. It keeps each claim (Z3, Colossus, ENIAC, Manchester Baby) with the qualifiers that make it true.
the other reading: see research/CONTENTIONS.md - C-2884 What was the first computer memory?
booked: The map keeps the competing readings; none is ruled.
the other reading: delay-line memory as the first computer memory (Shockley 1942 or Eckert 1944); the Williams tube as the first random-access memory, storing the Manchester Baby's program on 21 June 1948; ENIAC's tube accumulators as the first electronic store - C-2932 Where did virtual memory begin?
booked: The map keeps the competing readings; none is ruled.
the other reading: Guntsch 1956 as the first concept of virtual memory (the encyclopedia says the claim 'does not stand up to careful scrutiny': his addresses mapped directly onto the drums); Barton's 1958 suggestion of automatic allocation (Burroughs B5000)
Partners and parts published science
Built from / builds (15)
- Transistor
- SRAM
- DRAM
- Flash, ROM, PROM, EPROM, EEPROM
- Processor registers
- CPU caches (L1-L3)
- Memory controller
- Sense amplifiers
- Error-correcting codes
- Competition of early program stores (mercury delay line vs Williams tube)
- Competition for a host program's memory and execution (virus vs host program)
- Computer
- Computer hardware
- Working sets competing for main memory
- Instruction fetch and data operations competing for the bus (the von Neumann bottleneck)
Sits inside / holds (3)
Trades with (valence) (17)
- Cosmic rays via sys:cosmic-rays · Computer memory loss
- Alpha particle (helium-4 nucleus) via sys:residual-strong-force · Computer memory loss
- Thermal energy (heat, temperature and heat flow) via sys:thermal-energy · Computer memory loss
- Acoustic wave (sound: pressure waves in matter) via sys:acoustic-wave · Computer memory gain
- Human (Homo sapiens) via sys:sensory-environment · Computer memory gain
- Stored-program principle (instructions held in the same memory as data) via sys:electromagnetic-field · Computer memory even
- Central processing unit via sys:electromagnetic-field · Computer memory even
- Operating system via sys:electromagnetic-field · Computer memory gain
- Electricity via sys:electricity · Computer memory gain
- Magnetism via sys:electromagnetic-field · Computer memory gain
- Computer security via sys:electromagnetic-field · Computer memory loss
- Hard disk drive and solid-state drive via sys:hard-disk-drive · Computer memory gain
- Software vulnerability via sys:electromagnetic-field · Computer memory loss
- Computer program via sys:electromagnetic-field · Computer memory mixed
- Recursion: defining or computing a thing in terms of smaller versions of itself, as computer science and mathematics describe it, with its base cases, call stack, recursive data, induction, and its sightings in language and nature via sys:computer-memory · Computer memory even
- Matrix (mathematics): the rectangular array of numbers and its algebra, determinants and eigenvalues, matrices as linear maps, their history, and their use in physics, graphics and machine learning; the practice and the structure both booked via a matrix in a machine: entries held in memory and streamed through a matrix multiply unit · Computer memory even
- Sorting algorithm via sys:computer-memory · Computer memory even
expressed by (17)
- Templating / Standardization
- Interoperability/Transduction (Bridging)
- Encapsulation & Modularity (Abstraction)
- Amplification/Scale-Up (Manufacture & Distribution)
- Internal Coordination/Regulation
- Sensing/Scanning
- Mapping/Modeling
- Reactive Response
- Proactive Defense
- Physical/Virtual Barrier
- Self-Monitoring
- Enclave/Segregation
- Resilience & Repair
- Redundancy & Diversity
- Triage & Prioritized Allocation
- Quality Control & Error Correction
- Bridging Supply Gaps (Store & Dormancy)
floor filled by (34)
- Cosmic rays
- Alpha particle (helium-4 nucleus)
- Thermal energy (heat, temperature and heat flow)
- Memory protection (role: shell)
- Williams-Kilburn tube (the first random-access store the rule ran on)
- Mercury delay-line memory (programs stored as sound)
- Stored-program principle (instructions held in the same memory as data)
- Transistor
- Central processing unit
- Operating system
- Electricity
- Compiler
- Integrated circuit
- Memory manager and virtual memory
- SRAM
- DRAM
- Flash, ROM, PROM, EPROM, EEPROM
- Hard disk drive and solid-state drive
- Computer program
- memory hierarchy
- memory management unit
- Processor registers
- CPU caches (L1-L3)
- Memory controller
- Sense amplifiers
- Error-correcting codes
- Magnetic-core memory
- Memory refresh
- Flash translation layer
- Recursion: defining or computing a thing in terms of smaller versions of itself, as computer science and mathematics describe it, with its base cases, call stack, recursive data, induction, and its sightings in language and nature
- Computer
- Matrix (mathematics): the rectangular array of numbers and its algebra, determinants and eigenvalues, matrices as linear maps, their history, and their use in physics, graphics and machine learning; the practice and the structure both booked
- Computer hardware
- Sorting algorithm
Kinds (9)
- Williams-Kilburn tube (the first random-access store the rule ran on)
- Mercury delay-line memory (programs stored as sound)
- SRAM
- DRAM
- Flash, ROM, PROM, EPROM, EEPROM
- Hard disk drive and solid-state drive
- Volatile memory
- Non-volatile memory
- Semi-volatile memory
wired (4)
- Central processing unit
- Output devices (output organs, O)
- Processor (CPU, GPU)
- Input devices (input organs, I)
Notes published science
- Some of the first computer memories could be heard: mercury delay lines stored bits as sound pulses and some 'produced audible sounds ... akin to a human voice mumbling', so they were nicknamed 'mumble-tubs'; Alan Turing even proposed gin as the delay medium (src:wp:delay-line-memory).
- A bit in a modern flash cell is only about 100 electrons, and gaining or losing a few can change what it stores; the same cells that once survived 150,000 rewrites now manage about 3,000 (src:cai-2017-flash).
- Memory errors from space: at sea level about 95% of the particles that flip memory bits are neutrons from cosmic-ray showers, so computers on mountains see about ten times more errors, burying one in a cave nearly stops them, and the error rate falls when the Sun is active, because the Sun's field shields Earth from cosmic rays (src:wp:soft-error).
Layers
The ways it takes in its world, where they meet, and how it acts back, each from L1 (where it meets the world) up.
computer memory as computer engineers describe it: charge, fields and signals at the cells up to the stored program held for immediate use (reader's view)
- L1: The physical world at the memory: commands, addresses and data words arriving over the memory channel, the supply voltage, the controller's refresh timing, the heat around the chips, and the particles (cosmic-ray neutrons, alpha particles from packaging) that pass through the cells
- L2: Storage cells, one bit each: charge or no charge on a DRAM capacitor behind an access transistor, a six-transistor SRAM flip-flop, electrons on a flash floating gate; historically a recirculating pulse in mercury, a charge spot on a CRT, a magnetized ferrite core
- L3: Arrays and their circuits: rows (wordlines) and columns (bitlines), sense amplifiers that detect, latch and write back a whole row, refresh that rewrites leaking cells, and the codes that detect and correct flipped bits
- L4: Addressable words: cells grouped into words of fixed length, each reached by a binary address; chips and modules (DIMMs) on a memory channel, run by a memory controller
- L5: The memory hierarchy: registers, caches (SRAM), main memory (DRAM), mass storage (SSD, disk), nearline and offline storage; each level smaller and faster than the next; locality keeps what is in use near the processor; hardware moves data between memory and caches
- L6: Memory management: virtual memory (pages, page tables, the MMU's address translation, page faults and replacement), protection of each program's region, working sets; done by the operating system with hardware help
- L7: The stored program and its data held for immediate use: the instructions the processor fetches and the data those instructions fetch and store, kept available, buffered and protected
the boardroom (shared floors)
- L4: Addressable words, chips, modules, caches' arrays and the memory controller: where requests, writes, refresh, error checks, wear counts, page-ins and the access history meet as addressed words
- L5: The memory hierarchy: registers, caches, main memory, mass storage; locality and the hardware's movement of data between levels
- L6: Memory management: virtual memory and paging, the MMU's translation, protection, replacement, error handling (an uncorrectable error shuts the machine down), the flash translation layer's wear leveling
- L7: The stored program and its data held for immediate use
way in: Access history (the reference stream, read for locality)
- L1: The stream of references a running program makes to addresses
- L2: Recently used page table entries and lines kept in small fast stores (TLB, caches)
- L3: Replacement order: which page or line is least recently used
way in: Disturbance from neighbouring cells (RowHammer)
- L1: A neighbouring row's wordline toggled again and again (hammered)
- L2: Vulnerable cells lose charge faster than the 64 ms refresh can restore
- L3: Bits flipped in physically adjacent rows at predictable places
way in: Pages in from mass storage
- L1: Pages held in a swap file or the program's file on mass storage
- L2: A reference to a page not in real memory raises a page fault
- L3: The page copied into a free frame and its table entry updated
way in: Particles (cosmic-ray neutrons, alpha particles)
- L1: Energetic neutrons (about 95% of soft-error particles at the surface) and alpha particles from radioactive traces in packaging
- L2: Charge deposited near a cell changes its state
- L3: The upset stored until read; error-correcting codes detect and correct one or more bits
way in: Read requests (commands and addresses from the memory controller)
- L1: Commands and addresses issued by the memory controller across the memory channel
- L2: The addressed row opened (activated): its wordline switches the row's access transistors onto the bitlines
- L3: The row's charges sensed, amplified and latched by the sense amplifiers; a column address selects the word
way in: Refresh timing (the controller's refresh commands)
- L1: Refresh commands from the controller, every row within 64 ms (in a burst, or one row every 7.8 us for 8,192 rows)
- L2: The row read out
- L3: Charge restored by the sense amplifiers' write-back
way in: Supply power
- L1: The supply voltage
- L2: Volatile cells hold their state only while powered (and refreshed); on power loss DRAM contents decay over seconds, non-volatile cells keep theirs
way in: Temperature
- L1: The temperature of the chips and their surroundings
- L2: Cell charge decays faster when warm, slower when cold (under 1% in 10 minutes unpowered at about -50 C); in the field its effect on error rates is small
way in: Wear (program/erase cycles on flash)
- L1: Program and erase operations, electrons injected into and ejected from the floating gate through the tunnel oxide
- L2: Charge trapped in the oxide with each cycle; the oxide's insulation degrades and the cell leaks
- L3: The raw bit error rate rises with P/E cycles until ECC can no longer correct
way in: Writes (data words to store)
- L1: Data words driven onto the bus to be stored
- L2: The column's sense amplifier forced high or low, charging or discharging the cell capacitor (DRAM); electrons injected onto a floating gate (flash)
- L3: The whole open row written back, the new bit among them
way out: Charge restored to the cells (write-back and refresh)
- L1: Charge back on the capacitors
- L3: Sense amplifiers drive the bitlines to full rails
- L4: The controller's refresh command, or a read of the row
way out: Errors reported (corrected, or uncorrectable and fatal)
- L1: A crash or a shut-down, or corrupted data used
- L4: Correctable and uncorrectable errors counted at the controller and logged
- L6: An uncorrectable error judged serious enough to stop the machine
way out: Heat
- L1: Heat; at least kT ln 2 for each bit erased
- L4: Every access, transfer and refresh draws power; DRAM draws it even when idle
way out: Pages written out to mass storage
- L1: Modified frames written back to auxiliary storage
- L6: A page frame chosen for reclaim by the replacement algorithm
way out: Remanence (contents left readable after power-off)
- L1: A full memory image readable by anyone with physical access (cold boot)
- L2: Cells keep most of their charge for thousands of refresh intervals unpowered, longer when cold
way out: Words read out to the processor
- L1: The word sent across the memory channel to the controller and into a cache or register
- L4: The column's latched bit connected to the data bus
- L7: An instruction or datum asked for