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 ______.
A TLB hit costs 20+100 = 120 ns. A TLB miss costs 20+100+100 = 220 ns, or 220+5000+0.2×5000 = 6220 ns if a page fault occurs (10%). EMAT = 0.95×120 + 0.05×(0.9×220 + 0.1×6220) = 114 + 0.05×820 = 155 ns.
More Memory Management and Virtual Memory questions
GATE 2018 CS Q20– Consider a process executing on an operating system that uses demand paging. The average…
GATE 2015 CS (CS1) Q29– Consider a system with byte-addressable memory, 32-bit logical addresses, 4 kilobyte page…
GATE 2015 CS (CS1) Q57– Consider a main memory with five page frames and the following sequence of page…
GATE 2016 CS (CS1) Q57– Consider a computer system with 40-bit virtual addressing and page size of sixteen…
GATE 2016 CS (CS1) Q59– Consider a computer system with ten physical page frames. The system is provided with an…
GATE 2017 CS (CS1) Q50– Recall that Belady's anomaly is that the page-fault rate may *increase* as the number of…