• retagged by
2,925 views
4 4 votes

1 Answer

Best answer
11 11 votes

Answer : TLB tags bits =16.

Explanation -

Actually TLB is cache memory.

Hence this problem may be considered as in the subject CO

Here Page size = 16KB = 214 B. hence to represent all pages we need 14 bits.

TLB having 256 entries (i.e lines)

It uses 4 way set associativity, hence number of sets = 256/4 = 64 = 26 (Though it is already given, but this is actual method which will be helpful while solving other problems.

Now in set associative mapping

Virtual address is distributed as

Tag set number Block/page offset

Virtual address = 36 bit.

set number = bits required for representing sets = 6

Block/page offset = bits required for representing pages = 14

Hence Tag = VA bits - (set number + page offset)

Tag bits = 36 - (6+14)

Tag bits = 36 - 20 = 16

• selected by
Position:
Show:

Related questions

2 2 votes
1 1 answer
8.1k
8.1k views
ishan9 asked Feb 4, 2016
8,098 views
A CPU generates 32 bit virtual address. The page size is 2KB. The translation look aside buffer (TLB) can hold 256 page table entries and is 2 way set associative mapping...
0 0 votes
1 1 answer
2.1k
2.1k views
rahuljai asked Dec 3, 2018
2,133 views
Why the formula used here is not P(10) + (1-P)(50) = 20 ?;A computer keeps its page tables in memory. The time required to read a word from the pagetable is 50ns. To redu...
2 2 votes
3 3 answers
8.9k
8.9k views
Veerendra V asked Nov 8, 2016
8,947 views
Consider a paging system uses, TLB’s access time is 30 ns and memory access time is 200ns. If the effective memory access time is 150ns, what will be the hit ratio of TLB...
3 3 votes
1 answers 1 answer
2.1k
2.1k views
Na462 asked Nov 26, 2017
2,133 views
My doubt is Sorry if its silly.1. TLB Maps from VA PA, so when its accessed ? is it when cpu generates logical address and by hardware it get convert into virtual addre...