Exam 2: Early Memory Management Systems

In a fixed partition scheme,large jobs will need to wait if the large partitions are already booked,and they will be rejected if they're too big to fit into the largest partition.

The release of memory space by the Memory Manager is called ____.

The four memory management techniques presented in this chapter share the requirement that the entire program being executed must be ____.

The first-fit algorithm assumes that the Memory Manager keeps only one list containing free memory blocks.

The fixed partition scheme works well when ____.

____ consists of fragments of free memory between blocks of allocated memory.

Memory defragmentation is performed by the operating system to reclaim fragmented space.

Compaction should always be performed only when there are jobs waiting to get in.

For a fixed partition system,memory deallocation is relatively complex.

In a relocatable dynamic partition scheme,the ____ ensures that,during execution,a program won't try to access memory locations that don't belong to it.

One of the problems with the best-fit algorithm is that the entire table must be searched before the allocation can be made because the memory blocks are physically stored in sequence according to their location in memory.

After relocation and compaction,both the free list and the busy list are updated.

Single-user,fixed partition,and dynamic partition memory schemes share unacceptable fragmentation characteristics that were resolved with the development of ____.

In a dynamic partition system,a null entry in the busy list occurs when a memory block between two other busy memory blocks is returned to the free list.

____ of memory is performed by the operating system to reclaim fragmented sections of the memory space.

One approach to performing compaction is to do it when a certain ____ of memory becomes busy.

The phenomenon of less-than-complete use of memory space in a fixed partition is called ____.

Single-user systems in a non-networked environment allocate,to each user,access to all available main memory for each job,and jobs are processed sequentially,one after the other.

The goal of the ____ memory allocation algorithm is to find the smallest memory block into which a job will fit.

In the relocatable dynamic partitions scheme,the Memory Manager relocates programs to gather together all of the empty blocks and compact them to make one block of memory large enough to accommodate some or all of the jobs waiting to get in.