Question 1 Marks 25View more random threads:
- CS301 Assignment # 4 Due Date: 02-Feb-2016
- need cs501 3rd assignment idea
- CS403 assignment no 4
- MTH202 Discrete Mathematics Spring 2011 Assignment no 1...
- Assignment 4 Of MTH202 solution Fall 2010
- CS301 Data Structures Assignment No. 7 Solution Fall...
- Object Oriented Programming (CS304) Assignment No.1 fall...
- CS610 Computer Networks Assignment No. 3 Semester Spring...
- CS609 System Programming Assignment No. 03 Solution 21.01.2
- CS610 Computer Networks Assignment No. 5 Semester Spring...
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)