The Gateway to Computer Science Excellence
0 votes
146 views

 

in CO and Architecture by Loyal (7.1k points)
edited by | 146 views
0
I am getting 19 bits as the answer anybody verify
+1
Yes it should be 16+3 = 19.

Assuming memory is byte addressable
0

@Kunal Kadian 3 came from??

0

@manisha11 tag bits will obviously be needed and for block we will take as byte addressable and so 64 bits  = 64/8 = 8 bytes = 2^3 , so min value of x = 16+3 = 19 

0
oh yes 64/8 thanks

1 Answer

0 votes
To get minimun value of X , you should consider that it is block addressable where block size should be 64 bits.

So minimun number of bits will be only for tag bits.

So x=16.
by Junior (991 points)
0
how you got it, please explain little more ?
0
In full associative cache

PA is divided in two part - TAG and WO

where WO is word offset to represent which block in the word.

Now if system is word addressable i.e. we access whole word at a time , we dont need WO.

So PA will only consist of TAG bits.

Thus minimun PA = 16 bits.
0
What is block addressable, you can assume byte addressable giving total answer of 19 bits or word addressable giving answer of 16 bits (assuming one word of 8 Bytes). But default we always we take byte addressable i went with 19 bits.
0

@Rishabh Agrawal

d
oes this mean here one word is of 64bits ?

0
Actually somewhere it is Block addressable while somewhere it is word addressable.Just different terminology.
0

@kman30

Yes

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,833 questions
57,723 answers
199,444 comments
107,796 users