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 ________.
GATE CS 2020 (Forenoon) — Question 63
Operating Systems (OS)Memory Management and Virtual MemoryNAT2 marksHard
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.
More on Memory Management and Virtual Memory
- GATE CS 2026 (Afternoon) · Q54A system has a Translation Lookaside Buffer (TLB) that has a reach of 1 MB. TLB reach is defined as the total amount of physical memory tha…
- GATE CS 2026 (Afternoon) · Q55Consider contiguous allocation of physical memory to processes using variable partitioning scheme. Suppose there are 8 holes in the memory…
- GATE CS 2025 (Forenoon) · Q14Consider a demand paging memory management system with 32-bit logical address, 20-bit physical address, and page size of 2048 bytes. Assumi…
- GATE CS 2025 (Forenoon) · Q54In optimal page replacement algorithm, information about all future page references is available to the operating system (OS). A modificati…
- GATE CS 2025 (Afternoon) · Q47Consider a demand paging system with three frames, and the following page reference string: 1 2 3 4 5 4 1 6 4 5 1 3 2. The contents of the…
- GATE CS 2025 (Afternoon) · Q58A computer system supports a logical address space of 2 32 bytes. It uses two-level hierarchical paging with a page size of 4096 bytes. A l…

