GATE CSE 2020 Q63: Effective memory access time with TLB, page faults and dirty pages
- Operating System
- 2 marks
- NAT
- No negative marking
Question
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 lookup 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 _______.
Try it: numerical answer: type the value
Show answer and explanation
Answer: 154.5 to 155.5 (official GATE 2020 final answer key)
Concept used: Weight each path (TLB hit, TLB miss with page in memory, TLB miss with page fault, clean or dirty) by its probability.
First step: A TLB hit costs ns; a TLB miss adds a 100 ns page-table access, and a page fault adds 5000 ns (or 10000 ns if dirty) before the access.
Full step-by-step solution
Detailed working, common mistakes and linked mock tests will be available with a free GATEiit account. Log-in is coming soon.
Share this question
Source: official GATE 2020 CS question paper and final answer key, organised by IIT Delhi. Question paper · Answer key
More Operating System PYQs
- 2026 Session 1 · Q29False statements about deadlocks
- 2026 Session 1 · Q35Minimum resource instances for deadlock freedom (5 processes, max 2)
- 2026 Session 1 · Q59Disk transfer time for random sectors on tracks 5, 12, 7
- 2026 Session 1 · Q63Number of printf calls with fork, continue and break
- 2026 Session 1 · Q64Average FCFS waiting time for alternating A and C processes
- 2026 Session 2 · Q23CPU scheduling algorithm that cannot be preemptive