Help
Options
Didn't know it?
click below
click below
Knew it?
click below
click below
Don't Know
Remaining cards (0)
Know
retry
shuffle
restart
0:00
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.
Normal Size Small Size show me how
Normal Size Small Size show me how
OS Mod 3
| Question | Answer |
|---|---|
| The functionality of an operating system which handles or manages primary memory and moves processes back and forth between main memory and disk during execution. | Memory management |
| The process of mapping from one address space to another address space. | Address binding |
| The type of address binding where it is known at compile time where the process will reside in memory, generating an absolute physical address. | Compile time address binding |
| The type of address binding where the memory location is not known at compile time, resulting in a relocatable address that is translated by a loader. | Load time address binding |
| The type of address binding used if a process can be moved from one memory location to another during execution, allowing for dynamic linking and compaction. | Execution time address binding |
| A method used to obtain better memory-space utilization where a routine is not loaded into memory until it is actually called. | Dynamic loading |
| A method that helps the OS collect and merge various modules of code and data into a single executable file. | Linking |
| A linking method where libraries are linked at execution time, allowing the program code size to remain small. | Dynamic linking |
| An address generated by the CPU. | Logical address |
| An address seen by the memory unit. | Physical address |
| The hardware device responsible for the run-time mapping from logical addresses to physical addresses. | Memory management unit (MMU) |
| The base register in the MMU whose value is added to every address generated by a user process at the time it is sent to memory. | Relocation register |
| The process of reserving a partial or complete portion of computer memory for the execution of programs and processes. | Memory allocation |
| The partition of main memory where the operating system resides. | Low memory |
| The partition of main memory where user processes are held. | High memory |
| An allocation technique that sets aside some memory for the OS and gives the user program the rest, but does not support multiprogramming. | Single partition allocation |
| The oldest and simplest multiprogramming technique where main memory is divided into a fixed number of non-overlapping partitions. | Multiple fixed partitions (MFT) |
| An allocation algorithm where the first job claims the first available memory partition that has space more than or equal to its size. | First-fit allocation |
| An allocation algorithm that searches the whole memory and allocates a job to the closest-fitting free partition to use memory efficiently. | Best-fit allocation |
| An allocation algorithm that allocates the largest available hole, producing the largest leftover hole but scattering unused portions. | Worst-fit allocation |
| A problem that occurs when free memory space is broken into little pieces, leaving unused memory blocks too small to be allocated to processes. | Fragmentation |
| The type of fragmentation that occurs when a partition is too big for a process, leaving wasted space inside the assigned partition. | Internal fragmentation |
| The type of fragmentation that occurs when a partition is available but is too small for any waiting job to use. | External fragmentation |
| A partitioning technique where the system allows region sizes to vary dynamically, viewing available memory as one large block called a hole. | Variable partitions (MVT) |
| The process of merging a newly released memory hole with adjacent free holes to form one larger hole. | Coalescing |
| The process of shuffling memory contents to place all free memory together in one large contiguous block, solving external fragmentation. | Compaction |
| A memory management technique that permits a program's memory to be non-contiguous, minimizing external fragmentation by allocating physical memory wherever possible. | Paging |
| The fixed-sized blocks into which the operating system divides physical main memory. | Frames |
| The blocks of equal size to memory frames into which the system breaks a logical process. | Pages |
| The data structure used to translate a logical address into a physical address by storing the base address of each page in physical memory. | Page table |
| The part of a logical address that indicates what page the word resides in, used as an index into the page table. | Page number (p) |
| The part of a logical address that selects the exact word within the page, which is combined with the base address to define the physical address. | Page offset (d) |
| A memory management technique in which each job is divided into several variable-length segments of different sizes based on logical modules (e.g., main program, stack). | Segmentation |
| The table maintained by the OS for every process that stores the starting address (base) and the length (limit) of each segment. | Segment map table |
Created by:
user-1931754