CameraIcon

SearchIcon

MyQuestionIcon

3

You visited us 3 times! Enjoying our articles? Unlock Full Access!

Multilevel Page Tables 1

Consider a vi...

Question

Consider a virtual memory system with FIFO page replacement policy. For an arbitrary page access pattern, increasing the number of page frames in main memory will

A

always increase the number of page faults

No worries! We‘ve got your back. Try BYJU‘S free classes today!

B

sometimes increase the number of page faults

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

C

always decrease the number of page faults

No worries! We‘ve got your back. Try BYJU‘S free classes today!

D

never effect the number of page faults

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is B sometimes increase the number of page faults
Bleady's Anamoly increasing number of frames = increase in page faults.

Suggest Corrections

thumbs-up

2

Similar questions

Q. 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 computer system that has main memory size of 3 page frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of page faults under the corresponding page replacement policy. Then

Q. Consider a process execution on an operating system that uses demand paging. The average time for a memory access in the system is M units if the corresponding memory page is available in memory and D units if the memory access causes a page fault. It has been experimentally measured that the average time taken for a memory access in the process is X units.
Which one of the following is the correct expression for the page fault rate experienced by the process?

Q. A process has been allocated 3 page frames. Assume that none of the pages of the process are avaialable in the memory initially. The process makes the following sequence of page reference(reference string) : 1, 2, 1, 3, 7, 4, 5, 6, 3, 1.

Least Recently Used (LRU) page replacement policy is a practical approximation to optimal page replacenent. For the above reference string, how many more page fautls occur with LRU than with the optimal page replacement policy?

Q. 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______

Q. A processor user 2-level page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical adresses are both 32 bits wide. The memory is byte addressable. For virtual to physical address translation, the 10 most significant bits of the virtual address are used as index into the first level page table while the next 10 bits are used as index into the second level page table. The 12 least significant bits of the virtual address are used as offset within the page. Assume that the page table entries in both levels of page tables are 4 bytes wide. Further, the processor has a translation look-aside buffer (TLB), with a hit rate of 96% . The TLB caches recently used virtual page numbers and the corresponding physical page numbers. The processor also has a physically addressed cache with a hit ratio of 90 %. Main memory access time is 10 ns, cache access time is 1 ns. and TLB access time is also 1 ns.

Suppose a process has only the following pages in its virtual address space: two contiguous code pages starting at virtual address 0 x 00000000, two contiuous data page starting at virtual address 0 x FFFFF000. The amount of memory required for storing the page tables of this process is

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Multilevel Page Tables 1

OTHER

Watch in App

explore_more_icon

Explore more

Multilevel Page Tables 1

Join BYJU'S Learning Program

CrossIcon