Term
|
Definition
| a number that designates a particular memory location. |
|
|
Term
| best-fit memory allocation |
|
Definition
| a main memory allocation scheme that considers all free blocks and selects for allocation the one that will result in the least amount of wasted space. |
|
|
Term
|
Definition
| a register used to store the highest location in memory legally accessible by each program. |
|
|
Term
|
Definition
| the process of collecting fragments of available memory space into contiguous blocks by relocating programs and data in a computer |
|
|
Term
|
Definition
| the process of freeing an allocated resource, whether memory space, a device, a file, or a CPU. |
|
|
Term
|
Definition
| a memory allocation scheme in which jobs are given as much memory as they request when they are loaded for processing, thus creating their own partitions in main memory. |
|
|
Term
|
Definition
| a situation in which the dynamic allocation of memory creates unusable fragments of free memory between blocks of busy, or allocated, memory. |
|
|
Term
| first-fit memory allocation |
|
Definition
| a main memory allocation scheme that searches from the beginning of the free block list and selects for allocation the first block of memory large enough to fulfill the request. |
|
|
Term
|
Definition
| a memory allocation scheme in which main memory is sectioned with one partition assigned to each job. |
|
|
Term
|
Definition
| a situation in which a partition is only partially used by the program; the remaining space within the partition is unavailable to any other job and is therefore wasted. |
|
|
Term
|
Definition
| the unit that works directly with the CPU and in which the data and instructions must reside in order to be processed. Also called random access memory (RAM), primary storage, or internal memory. |
|
|
Term
|
Definition
| an empty entry in a list. |
|
|
Term
|
Definition
| another term for main memory. |
|
|
Term
| relocatable dynamic partitions |
|
Definition
| a memory allocation scheme in which the system relocates programs in memory to gather together all empty blocks and compact them to make one block of memory that |
|
|
Term
|
Definition
| a register that contains the value that must be added to each address referenced in the program so that the Memory Manager will be able to access the correct memory addresses. |
|
|
Term
|
Definition
| (1) the process of moving a program from one area of memory to another; or (2) the process of adjusting address references in a program, by either software or hardware means, to allow the program to execute correctly when loaded in different sections of memory. |
|
|
