quiz 1
The ____ demonstrates that when using a FIFO policy, in rare cases, adding more memory to a system can cause an increase in page interrupts.
Belady Anomaly
The ____ page replacement policy is based on the theory that the best page to remove is the one that has been in memory the longest.
FIFO
In a paged memory allocation scheme, the ____ contains two values for each active job: the size of the job and the memory location where its Page Map Table is stored.
Job Table
A ____ chip holds software that is used to start the computer.
RAM
Main memory is also known as ____.
RAM
Cache memory is divided into blocks of equal size called ____.
Slots
Fixed partitions are also called ____ partitions.
Static
The fixed partition scheme works well when ____.
all jobs are of similar size
The purpose of cache memory is to keep handy the most recently accessed data and instructions so that the CPU can access them repeatedly without wasting time. This purpose is similar to that of the ____ of a Web browser.
bookmark file
____ can be thought of as being an intermediary between main memory and the special-purpose registers, which are the domain of the CPU.
cache memory
A variation of the LRU page replacement algorithm known as the ____ replacement policy is implemented with a circular queue.
clock page
There are two types of real-time systems depending on the consequences of missing the deadline. A ____ real-time system risks total system failure if the predicted time deadline is missed.
constrained
Memory compaction is also referred to as ____.
defragmentation
The ____ uniquely identifies each resource, starts its operation,monitors its progress, and, finally, deallocates it, making the operating system available to the next waiting process.
device manager
A disadvantage of segmented memory allocation is ____.
external fragmentation
The ____ method keeps the free/busy lists organized by memory locations, from low-order memory to high-order memory.
first-fit memory allocation
____ is where the data and instructions of a computer must reside to be processed.
main memory
With the development of ____ technology, a single chip was equipped with two or more processor cores.
multicore
____ allows separate partitions of a single server to support different operating systems.
multiprocessing
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.
overhead
In demand paging, the collection of pages residing in memory that can be accessed directly without incurring a page fault is called the ____.
page set
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.
relocation register
The goal of the ____ memory allocation algorithm is to find the smallest memory block into which a job will fit.
smallest fit
The word ____ is used to indicate that a program is permanently held in ROM (read only memory), as opposed to being held in secondary storage.
software
In demand paging, pages are ____ between main memory and secondary storage.
swapped
To access a location in memory when using segmented memory management, the address is composed of two entries: ____.
the segment number and the displacement
In demand paging, when an excessive number of pages are moved back and forth between main memory and secondary storage, it is called ____.
thrashing
The ____ is often very different from one operating system to the next, sometimes even between different versions of the same operating system.
user interface
A system with ____ divides programs into parts and keep them in secondary storage, bringing each part into memory only as it is needed.
virtual memory
One of the most important innovations of demand paging is that it makes ____ feasible.
virtual memory
