| A | B |
|---|
| Amt. of memory and how is optimized | 2 things the performance of system is directly dependent on |
| Single-user System | 1 of 4 of early memory allocation schemes |
| Fixed Partitions | 1 of 4 early memory allocation schemes |
| Dynamic Partitions | 1 of 4 early memory allocation schemes |
| Relocatable Dynamic Partitions | 1 of 4 early memory allocation schemes |
| Entire program loaded in memory | 1 of 3 requirements of all early memory allocation schemes |
| Programs stored contiguously in memory | 1 of 3 requirements of all early memory allocation schemes |
| Programs remain in memory until done | 1 of 3 requirements of all early memory allocation schemes |
| Finite amount of memory | Significant limiting factor of all computers |
| Sequentially | Order in which jobs are processed in a single-user allocation system |
| One | Number of jobs a single-user allocation system can handle at one time |
| Static Partition | Another name for a fixed partition -- partition sizes are set and do not change |
| Size of the job | In fixed partition allocation, what must be matched with the size of the partition |
| Memory Partition size | One of the items in the table kept by the Memory Manager with a Fixed Partition allocation |
| Large jobs may have a long turnaround | What may happen if the partitions for a Fixed Partition Allocation are too small |
| Memory will be wasted | What may happen in a Fixed Partition Allocation are too large |
| Job given only as much memory as needed | With Dynamic Partition Allocation the manner in which memory is allocated |
| External fragmentation | Fragments of free memory between blocks of allocated memory in Dynamic Partition allocation |
| First-Fit | Allocation method used with both fixed and dynamic partition allocation schemes which places job in the first available space |
| Best-Fit | Allocation method used with both fixed and dynamic partition allocation schemes which matches the closest fit of a job to the memory partition size available |
| Faster allocation of memory | First-fit allocation is faster that best-fit allocation |
| By memory locations | How the first-fit allocation organizes the free/busy list |
| By size of job from smallest to largest | How the best-fit allocation organizes the free/busy list |
| Problem with Best-Fit allocation | Entire table must be searched each time a job needs to be loaded |
| Deallocated | Release of memory space |
| Free | In a Fixed Partition scheme, status of memory block where job was stored is set to this when the memory space is deallocated |
| Relocatable Dynamic Partition | Allocation scheme that uses relocation of jobs and compaction of memory to improve memory allocation |
| Free and Busy | The list updated in Relocatable Dynamic Partition allocation following relocation and compaction |
| Bounds register | Used in Relocatable Dynamic Partition to keep track of the size (boundary) of the job |
| Relocation register | Used in Relocatable Dynamic Partition to keep track of the number to be added to the original location of the job |
| Compacting and relocating | With Relocatable Dynamic Partition, this optimizes the use of memory and improves throughput |
