Quiz# 7: Virtual Memory
1. In a paging system with page table stored in memory, how many memory
references are made?
|
|
2. Why are TLBs good?
|
|
Because TLBs are always managed in hardware, translation is faster.
|
|
If we get a TLB hit, we cut down on memory references which makes translation of virtual addresses faster.
|
We do not need page tables with TLBs.
|
3. With a logical address space of 16 pages of 1024 words each, and a physical
memory of 64 frames, what is the number of bits in the logical address?
|
|
4. From the previous question, what is the number of bits in the physical address?
|
|
5. In a system with virtual memory, if there is a TLB miss and the inverted page
table does not contain the process' virtual page number, the virtual address
is invalid and an AddressErrorException should be generated.
|
|
True
|
False
|
6. Upon a TLB miss, it is sufficient to locate the virtual address in the
inverted page table.
|
|
True
|
False
|
7. Assume a page reference string of length p for a process with m frames
(initially all empty). The page reference string has n distinct page
numbers in it. For any page replacement algorithm, what is a lower bound on
the number of page faults?
|
|
n
|
|
p
|
|
m
|
m*n
|
8. From the previous question, what is an upper bound on the number of page
faults?
|
|
n
|
|
p
|
|
m
|
m*n
|
|