edited by
369 views
0 votes
0 votes

Consider a paging system with the page table in memory. Each memory reference takes $200$ ns. The TLB has hit ratio of $75 \%$ and the time to look for pages in TLB is almost negligible. What is the effective paged memory reference time in ns?

  1. $400$
  2. $250$
  3. $150$
  4. $200$
edited by

1 Answer

Best answer
2 votes
2 votes
Case 1: The entry is in associative register it takes 200 ns to access the word memory. This happens 75% of time(w1). Let THIS 200 ns be c1.

Case 2: If the page is not in associative register --> 400 nanoseconds: 200 nanoseconds to access the page table and 200 nanoseconds to access the word in memory. This happens 25% of time(w2). Let this 400 ns be c2
Thus, effective access time is
= w1c1 + w2c2
= (0.75 × 200 ns) + (0.25 × 400 ns)
= 250 ns
selected by
Answer:

Related questions

2 votes
2 votes
1 answer
1
Bikram asked Dec 26, 2016
281 views
Consider the following 3 processes with 3 binary semaphores with initial values $S_{0}=0, S_{1}=0, S_{2}=1$$$ \begin{array}{|c|c|c|} \hline \textbf{P} & \textbf{Q} & \tex...
2 votes
2 votes
3 answers
2
Bikram asked Dec 26, 2016
1,109 views
In a paged memory, the page hit ratio is $0.35$. The time required to service the page fault is $100$ ns. Time required to access a page in primary memory is $10$ ns.The ...
1 votes
1 votes
1 answer
4
Bikram asked Dec 26, 2016
215 views
A counting semaphore is initialized to $10$. The $6$ P(wait) operations and $4$ V(signal) operations were completed in this semaphore. The resulting value of semaphore is...