Scribd
Upload
31 views

Practice Set DPVM

Uploaded by

pranavd2602
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
31 views

Practice Set DPVM

Uploaded by

pranavd2602
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Practice Set- Virtual Memory and demand Paging

Q1. Consider a paging system that uses 1-level page table residing in main memory and a TLB for
address translation. Each main memory access takes 100 ns and TLB look up takes 20 ns. Each page
transfer to/from the disk takes 5000 ns. Assume that the TLB hit ratio is 95%, page fault rate is 10%.
Assume that for 20% of the total page faults, a dirty page has to be written back to disk before the
required page is read in from disk. TLB update time is negligible. The average memory access time in
ns (round off to 1 decimal places) is______.

Q2. Assume the amount of memory on a system is inversely proportional to page fault rate. Each
time when memory doubles the page fault rate is reduced by third. Currently system has 32mb of
memory and page fault rate is 2% the main memory access time is 500ns. And effective memory
access time is 300 μ sec. if the main memory is increased to 128 mb, then what would be the overall
effective access time________.

Q3. Consider a paging hardware with a TLB. Assume that the entire page table and all the pages
are in the physical memory. It takes 10 milliseconds to search the TLB and 80 milliseconds to
access the physical memory. If the TLB hit ratio is 0.6, the effective memory access time (in
milliseconds) is _________.
Q4. Consider the virtual page reference string
1, 2, 3, 2, 4, 1, 3, 2, 4, 1
On a demand paged virtual memory system running on a computer system that main memory size
of 3 pages frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of
page faults under the corresponding page replacements policy. Then
(A) OPTIMAL < LRU < FIFO
(B) OPTIMAL < FIFO < LRU
(C) OPTIMAL = LRU
(D) OPTIMAL = FIFO
Q5. Consider a computer system with ten physical page frames. The system is provided with an
access sequence a1, a2, …, a20, a1, a2, …, a20), where each ai number. The difference in the
number of page faults between the last-in-first-out page replacement policy and the optimal page
replacement policy is __________
(A) 0
(B) 1
(C) 2
(D) 3
Q6. Consider a single level paging scheme with a TLB. Assume no page fault occurs. It takes 20
ns to search the TLB and 100 ns to access the physical memory. If TLB hit ratio is 80%, the
effective memory access time is _______ msec.
Ans: 140 ns.
Q7. Consider a single level paging scheme with a TLB. Assume no page fault occurs. It takes 20
ns to search the TLB and 100 ns to access the physical memory. If effective memory access time
is 130 ns, TLB hit ratio is ______.
Ans: 90%
Q8. A system uses 3 page frames for storing process pages in main memory. It uses the First in
First out (FIFO) page replacement policy. Assume that all the page frames are initially empty. What
is the total number of page faults that will occur while processing the page reference string given
4 , 7, 6, 1, 7, 6, 1, 2, 7, 2 ?
A) 40%
B) 60%
C) 4%
D) 6%
Answer (B)
Q9. Let the page fault service time be 10 ms in a computer with average memory access time being 20
ns. If one page fault is generated for every 106 memory accesses, what is the effective access time for
the memory?
Ans : 30 ns

Q10. A demand paging system takes 100 time units to service a page fault and 300 time units to
replace a dirty page. Memory access time is 1 time unit. The probability of a page fault is p. In case
of a page fault, the probability of page being dirty is also p. It is observed that the average access
time is 3 time units. Then the value of p is______?
Ans: 0.019258

You might also like