retagged by
759 views
0 votes
0 votes
Consider a k-level paging system along with a TLB. A TLB takes 10ns, and a memory takes 100ns on average. The hit ratio of TLB is equal to 0.8. If it is known that the average memory access time is 70ns, then the value of k is?
retagged by

1 Answer

0 votes
0 votes
TLB = t = 10ns

Memory time = m = 100ns

Hit ratio (tlb) = p = 0.8

Miss ratio = 1 – p = 0.2

Let assume there are k level for checking :

then formula for the Effective time calculation :

T effective = p( t + m ) + (1-p)(t + km + m  )

T effective  = pt + pm + t + km – pt – pkm + m – mp  → t +m(k+1) ( 1-p)

Now , we only put the value in te formula :

T effective = t + (1-p) m (k+1)

70 = 10 + ( 1 – 0.8) * (k+1)* 100

60 = 0.2 * (k+1) * 100

60 = 20 *(k+1)

k = 3 – 1 = 2

ANSWER IS 2 LEVEL WILL REQUIRE :)

Related questions

1.2k
views
1 answers
1 votes
Soumya Tiwari asked Dec 2, 2018
1,213 views
Consider the following sequence:Process P1 of size 7k loadedProcess P2 of size 4k loadedProcess P1 is terminated and space is returnedProcess P3 of size 3k loadedProcess P4 of size ... ? (Assume frame size is 1K).A 1K B 2K C 3K D NONE
1.8k
views
2 answers
1 votes
Na462 asked Jul 18, 2018
1,839 views
Which of the following is true?A. If the page size increases page fault rate may also increase.B. Multi-level paging optimizes program execution time ... increases program execution time.Correct OptionD. TLB is a software data structure.
1.3k
views
2 answers
2 votes
admin asked Mar 30, 2020
1,290 views
A CPU generates $32$-bit virtual addresses. The page size is $4$ KB. The processor has a Translation Look-aside Buffer (TLB) which can hold a total of $128$ page table ... $\text{13 bits}$\text{15 bits}$\text{20 bits}$
377
views
0 answers
0 votes
admin asked Oct 26, 2019
377 views
Write a program that can be used to compare the effectiveness of adding a tag field to $TLB$ entries when control is toggled between two programs. The tag ... nontrivial) input example.Plot the number of $TLB$ updates per $1000$ references.