Exam 2: Memory Management: Early Systems

The ____ contains the value that must be added to each address referenced in the program so it will be able to access the correct memory addresses after relocation.

A null entry in the busy list occurs when a memory block between two other busy memory blocks is returned to the free list.

____ is the first step in the algorithm to load a job in a fixed partition.

The ____ of memory, sometimes referred to as garbage collection or defragmentation, is performed by the operating system to reclaim fragmented sections of the memory space.

The problem of partition intrusion is present in single-user contiguous allocation schemes.

The ____ keeps the free/busy lists organized by memory locations, low-order memory to high-order memory.

The following algorithm can be described as ____. 1 Initialize memory_block(0) = 99999 2 Compute initial_memory_waste = memory_block(0) - job_size 3 Initialize subscript = 0 4 Set counter to 1 5 Do while counter <= number of blocks in memory If job_size > memory_size(counter) Then counter = counter + 1 Else Memory_waste = memory_size(counter) - job_size If initial_memory_waste > memory_waste Then subscript = counter Initial_memory_waste = memory_waste Counter = counter + 1 End do 6 If subscript = 0 Then put job in waiting queue Else Load job into memory_size(subscript) Adjust free/busy memory lists 7 Go fetch next job

In a dynamic partition scheme, ____, is how the Memory Manager deallocates a block that is between two other free blocks?

____ is how memory is deallocated in a fixed partition scheme.

The fixed partition scheme works well ____.