0
$\begingroup$

I am going over some practice questions for the Major field exam and it asks:

A processor with a word-addressable memory has a two-way set-associative cache. A cache line is one word, so a cache entry contains a set of two words. If there are M words of memory and C cache entries, how many words of memory map to the same cache entry?

I am not sure how to even approach this problem since I am not too familiar with computer organization. Any help would be appreciated. Thanks!

$\endgroup$
  • 1
    $\begingroup$ If you aren't familiar with cache organisation, then you should go over it once before attempting it. This is a fairly easy problem. This should cover most of what you need. $\endgroup$ – Gokul Dec 2 '18 at 7:57
  • $\begingroup$ Since when gre started taking computer science subject test! :O $\endgroup$ – Mr. Sigma. Dec 2 '18 at 11:22
0
$\begingroup$

The correct answer is M/C. This question is on the Computer science Major Field Assessment Test. https://www.ets.org/Media/Tests/MFT/pdf/mft_samp_questions_compsci.pdf

$\endgroup$
-1
$\begingroup$

Cache has C/2 fixed locations

which further implies, we have

M / (C/2) = 2M/C

words of memory which map to same location

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.