310 views

1 Answer

1 votes
1 votes

Q.30 ) Design 1 : Fully Associative Cache Memory

Word Size = 16 bits = 2 Bytes
$\text{Cache Size} = \frac{256KB}{2B} = 128K \text{words}$
Block Size = 1K words
# Cache lines = 128K / 1K = 128

Therefore, # Tag Comparators required = # Cache Lines = 128

Q. 31 ) Design 2 : 8 Way Set Associative Cache Memory

Block Size = 64 words
# Cache Lines = 128K / 64 = 2K
#Sets = 2K / 8 = $2^8$
Therefore, tag size = 32 - 8 - 6 = 18 bits

Tag Memory Size = #Cache lines * tag size = 2K * 18 bits = 4.5 KBytes

Related questions

0 votes
0 votes
2 answers
1
Sourabh Kumar asked Jun 26, 2015
670 views
https://gateoverflow.in/?qa=blob&qa_blobid=3717160066093697882
2 votes
2 votes
1 answer
2
Arjun asked Jan 11, 2016
473 views
How do you compare associativity (in cache) to chaining in hash table?
1 votes
1 votes
1 answer
3