Discover published sets by community

The process of reclaiming memory occupied by objects that are no longer in use by the program.

A small-sized type of volatile computer memory that provides high-speed data access to a processor and stores frequently used computer programs, applications and data.

Concept that structures memory types in a system by response time, cost per byte and size. Includes registers, cache, main memory, and disk storage.

A marker in computing that indicates whether a page in memory has been modified (written to) after being loaded from storage. If true, the page must be written back to storage before being replaced.

An abstraction where memory management provides an idealized interface to the physical memory, allowing for creation of large virtualized address spaces or the illusion of having more physical memory.

Associating a file or a block of memory with a segment of virtual memory space. A process can manipulate the file as if it were a consecutive array of bytes in the process's memory.

Wasted space internal to a partition due to the fact that the block of data loaded is smaller than the partition.

Memory management technique that allocates a single contiguous section of memory to a process.

A memory management scheme by which a computer stores and retrieves data from secondary storage for use in main memory, with each storage location in main memory having a 'page' and its equivalent location in secondary storage called a 'page frame'.

The actual location in main memory (RAM) where a data byte is stored.

Memory is divided into variable-sized blocks during runtime, depending on the requirements of the processes.

A condition where the system is spending a majority of its time swapping pages, rather than executing instructions, due to excessive paging.

The process by which computer programs and services are assigned with specific blocks or cells of a computer's memory.

A strategy where pages are loaded into memory only when they are needed, rather than preloading all of a program's pages.

Wasted space external to the allocated memory blocks. It occurs when free memory is separated into small blocks and is interspersed with allocated blocks.

A simple page replacement algorithm that removes the oldest page in memory, based on arrival time, to make room for a new page.

Occurs when a program tries to access a page that is mapped in the virtual address space, but not loaded into physical memory.

Determining how many frames to allocate to a process in a system with multiple processes running.

A hardware component responsible for handling accesses to the physical memory required by the CPU. It translates logical addresses into physical addresses.

Divides memory into fixed size regions. Each partition can contain exactly one process.

The process of moving processes in memory from one address space to another to ensure efficient use of memory and to avoid fragmentation.

A designated area of a hard disk used to supplement the computer's RAM, effectively increasing the amount of memory available.

The algorithm used by an operating system to decide which memory pages to page out when a new page needs to be brought in.

A page replacement policy that selects the least recently accessed page for removal to make space for a new page.

A cache that memory management hardware uses to improve virtual address translation speed.

An address generated by the CPU during a program's execution, and translated to a physical address by the memory management unit during the memory access stage.

A memory management scheme that divides the process memory into variable-sized parts. Each part is called a segment.

The process of reorganizing memory to place all free memory together in one large block and thus eliminate fragmentation.

Memory is allocated in a scattered fashion throughout memory, not requiring a single contiguous block. Examples include Paging and Segmentation.