edited by
20,743 views
48 48 votes

A paging scheme uses a Translation Look-aside Buffer (TLB). A TLB-access takes $10$ ns and the main memory access takes $50$ ns. What is the effective access time(in ns) if the TLB hit ratio is $\text{90\%}$ and there is no page-fault?

  1. $54$
  2. $60$
  3. $65$
  4. $75$

5 Answers

Best answer
57 57 votes
Effective access time $=$ hit ratio $\times$ time during hit $+$ miss ratio $\times$ time during miss

In both cases TLB is accessed and assuming page table is accessed from memory only when TLB misses.

$= 0.9 \times (10+50) + 0.1 \times (10 + 50 + 50)$

$= 54 + 11=65$

Correct Answer: $C$
edited by
11 11 votes
Answer is (C) Part.

Just one more approach -->

$Effective Access Time = Address Translation Time + Main Memory Access Time$

= $10 + 0.1(50) + Main Memory Access Time = 15 + 50 = 65ns$
2 2 votes
answer :- (c) 65

reason-

Given : TLB access time =  10 ns

main memory access time = 50 ns

TLB hit ratio= 90%  i.e (0.9)

now we first need to find miss ratio that is [1- TLB hit ratio]

miss ratio= 1- 0.9= 0.1

now calculating the effective access time by formula,

hit ratio X (TLB access time + memory access time) + miss ratio X (TLB access ratio + 2 X memory access ratio)

= 0.9X(10 ns + 50 ns)+ 0.1 X (10 ns + (2 X 50 ns))

=0.9 X 60 ns + 0.1 X 110ns

=54 ns + 11 ns

=65 ns
edited by
–3 –3 votes

"there is no page-fault"  means we should just put

10ns + 50ns =60 ns

reshown by
Answer:
Position:
Show:

Related questions

47 47 votes
3 answers 3 answers
11.8k
11.8k views
Ishrat Jahan asked Oct 28, 2014
11,753 views
Match the following flag bits used in the context of virtual memory management on the left side with the different purposes on the right side of the table below.$$\small ...
39 39 votes
5 answers 5 answers
21.7k
21.7k views
Ishrat Jahan asked Oct 28, 2014
21,738 views
An operating system implements a policy that requires a process to release all resources before making a request for another resource. Select the TRUE statement from the ...
58 58 votes
5 answers 5 answers
16.1k
16.1k views
Ishrat Jahan asked Oct 28, 2014
16,068 views
The following is a code with two threads, producer and consumer, that can run in parallel. Further, $S$ and $Q$ are binary semaphores quipped with the standard $P$ and $V...
86 86 votes
9 answers 9 answers
36.8k
36.8k views
Ishrat Jahan asked Oct 28, 2014
36,819 views
Assume that a main memory with only $4$ pages, each of $16$ bytes, is initially empty. The CPU generates the following sequence of virtual addresses and uses the Least Re...