Term
| What is an address generated by the CPU commonly referred to as? |
|
Definition
|
|
Term
| What is a logical address usually referred to as? |
|
Definition
|
|
Term
| What is the run-time mapping from virtual to physical address done by? |
|
Definition
| A hardware device called the memory-management unit (MMU) |
|
|
Term
| The task of removing an idle application from memory so others can use the memory is called what? |
|
Definition
|
|
Term
| In _________________, each process is contained in a single linear physical section of memory |
|
Definition
| Contiguous memory allocation |
|
|
Term
| The three most commonly used strategies for selecting a free hole in memory are in the following list. Which is one of those strategies? |
|
Definition
First fit
Best fit
Worst fit |
|
|
Term
| What is external fragmentation? |
|
Definition
| storage is fragmented into a large number of small holes. Exists when there is enough total memory space to satisfy a request but the acailable paces are not contiguous. |
|
|
Term
| What is internal fragmentation? |
|
Definition
| unused memory that is internal to a partition. |
|
|
Term
| What is a memory-management scheme that permits the physical address space of a process to be noncontiguous? |
|
Definition
|
|
Term
| The basic method for implementing paging involves breaking physical memory into fixed-sized blocks called ________ |
|
Definition
|
|
Term
| Every address generated by the CPU is divided into two pairs: a _______ number and a _______ offset |
|
Definition
|
|
Term
| in a paged environment what is accomplished by protection bits associated with each frame? |
|
Definition
|
|
Term
| With ___________ virtual memory, pages are only loaded when they are needed during program execution; pages that are never accessed are never loaded into physical memory. |
|
Definition
|
|
Term
| When a process accesses a page that was not brought into memory a __________ occurs. |
|
Definition
|
|
Term
| The OPT or MIN page replacement algorithm is: |
|
Definition
| Replace the page that will not be used for the longest period of time |
|
|
Term
| The LRU (least-recently used) page replacement algorithm states: |
|
Definition
| When a page must be replaced, LRU chooses the page that has not been used for the longest period of time.
LRU associates with each page the time of that page's last use. |
|
|
Term
| A process is ________ if it is spending more time paging than executing |
|
Definition
|
|
