I am currently reviewing for my exam in computer architecture. I've run into a question in the old exam sets that I can't really figure out. The question is regarding caches, more specifically block offset, set index and tag. The question is as follows: enter image description here

The old sets come with solutions. The solution to the problem is as follows:

enter image description here

Unfortunately, it doesn't state how to get there. I'm at a loss here and would really like to understand this. Any help would be appreciated :)

  • 2
    $\begingroup$ Assuming the system is byte addressable, each block is of size 8 bytes. To address them, we'll need $\log_2(8) = 3$ bits. Thus, the last three bits will correspond to the block offset. You have to do the same for sets also and to find the tag, just subtract index and offset from the total size of the address. Can you proceed from here? $\endgroup$
    – Gokul
    May 29, 2019 at 9:53
  • 1
    $\begingroup$ The title you have chosen is not well suited to representing your question. Please take some time to improve it; we have collected some advice here. Thank you! $\endgroup$
    – dkaeae
    May 29, 2019 at 11:25


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Browse other questions tagged or ask your own question.