Computer memory Created 2026-10-13 Updated 2026-11-05
Computer memory stores information that a computer can retrieve while executing computer programs. A memory location holds a value, and a memory address selects a location under the machine's addressing rules. In a byte-addressed example, consecutive bytes have consecutive memory addresses; a four-byte value can occupy four locations. The interpretation of those stored bits as a number, an instruction or another representation belongs to the computer program and architecture.
Computer memory has different physical and logical roles. Non-volatile memory retains stored information without power, while other technologies require power to retain it. A memory cache holds selected information for faster reuse; virtual memory presents an operating-system process with its own address space. These describe different properties, so a cached value and its virtual address should not be confused with the physical storage holding it.
In the paging examples, resident memory pages occupy main computer memory, and address translation maps a virtual address to a physical address. The operating system can change a mapping while keeping an operating-system process's numerical virtual address unchanged. This separation makes controlled sharing and isolation possible.[ref]
Flash memory 2026-10-31
Non-volatile memory programmed and erased electrically. Its program and erase granularities need not match the block size exported to a file system.
Reusing a block-oriented file system preserves existing operating-system interfaces, tools, consistency procedures and on-disk formats. It also permits common buffering and caching policies. Large transfers can still amortize software and controller overhead, and flash memory itself has page-program and erase-block constraints, so a block device abstraction is often useful even without mechanical motion.
The costs are that a fine-grained change may require reading and rewriting a larger logical block, and a small computer file can waste part of its final file data block. Structures optimized to reduce seek time need not be best for non-volatile memory. For flash memory, repeated metadata updates and erasing or relocating larger regions can increase physical writes and consume finite program/erase endurance. A translation layer can hide these constraints but adds mapping space and work.
Consequently
The balance depends on the actual medium: byte-addressable non-volatile memory and page/erase-based flash memory have different physical constraints.