Exam 2: Memory Management: Simple Systems

Research continues to focus on finding the optimum allocation scheme.

By compacting and relocating,the Memory Manager optimizes the use of memory and thus improves throughput.However,it also requires more ____ than the other memory allocation schemes discussed in this chapter.

Fixed partitions are also called ____ partitions.

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.

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

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.

The fixed partition scheme does not require that the entire program be stored contiguously and in memory from the beginning to the end of its execution.

In the fixed-partition memory management scheme,the table that the Memory Manager uses to keep track of jobs is composed of the ____.

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

The best-fit allocation method keeps the free/busy lists organized by memory locations,low-order memory to high-order memory.

In a relocatable dynamic partition scheme,the ____ contains a value that must be added to each address referenced in a program so that the system will be able to access the correct memory addresses after relocation.

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

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

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

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

A(n)____ in the busy list occurs when a memory block between two other busy memory blocks is returned to the free list.

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

The bounds register is used to store the highest (or lowest,depending on the specific system)location in memory accessible by each program.

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.

Main memory is also known as ____.