Question 1 Marks 25View more random threads:
- CS403 assignment no 5 fall 2010 solution on 29/01/2011
- cs501 Assignment no 3 Solution 20th January 2016
- CS614 Data Warehousing Assignment No. 03 Semester Spring...
- CS402 Theory of Automata idea solution assignment no 3...
- CS607 Artificial Intelligence assignment no 5 idea solution...
- CS615 Software Project Management Assignment No. 2 Solution...
- MCM401 Fundamentals of Public Relations Assignment No.1...
- CS408 Human Computer Interaction Assignment No.2 Fall...
- cs201 assignment no 1 may 2015 solution
- CS508 Modern Programming Languages Assignment No.4 Fall...
Consider a paging system with a page table stored in memory.
(a) Marks 5
If a memory reference takes 200 nanoseconds, how long does a paged reference take
(reference is retrieved from page table in memory and then program data is retrieved
from memory) Assume all pages are in memory?
(b) Marks 10
If we add a Translation Look-aside Buffer (TLB), and 75 percent of all page-table
references are found in the TLB i.e. the TLB hit ratio is 75%, what is the effective
memory reference time on average? (Assume that finding a page table entry in TLB takes
10 nanoseconds, if the entry is there.) Assume all pages are in memory.
(c) Marks 10
What is the effective memory reference time if the hit ratio for TLB is 70%, the hit ratio
for memory is 20%, and 10% of the time we must go out to the disk to load the faulted
page in memory, where context switching, disk transfer time takes 100 m seconds
Sponsored Links
There are currently 1 users browsing this thread. (0 members and 1 guests)