GATE CS 2014 Set 3 — Question 43
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.NAT+2 / -0MediumTLB & EATMemory ManagementOperating System
Operating System → Memory Management → TLB & EAT
Last updated
Question
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 _________.
Correct answer
122 to 122
Solution
Let be the TLB search time, be the memory access time, and be the hit ratio.
Given:
ms
ms
Case 1: TLB Hit
Time = (Search TLB + Access Data)
Time = msCase 2: TLB Miss
Time = (Search TLB + Access Page Table + Access Data)
Time = msEffective Memory Access Time (EMAT):
ms
Given:
ms
ms
Case 1: TLB Hit
Time = (Search TLB + Access Data)
Time = msCase 2: TLB Miss
Time = (Search TLB + Access Page Table + Access Data)
Time = msEffective Memory Access Time (EMAT):
ms
Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on Memory Management
2026 Set 2 Q23Which one of the following CPU scheduling algorithms cannot be preemptive?2026 Set 1 Q29With respect to deadlocks in an operating system, which of the following statements is/are FALSE?2026 Set 1 Q31In the context of relational database normalization, which of the following statements is/are true?2026 Set 1 Q35Consider a system consisting of instances of a resource , being shared by 5 processes.…2026 Set 2 Q51Consider three processes P1, P2, and P3 running identical code, as shown in the pseudocode below. A…