A direct mapped cache with 4 blocks and 2 words per block is initially empty. The table shows 8 word addresses in hexadecimal that are referenced. To fill out the table, the hexadecimal addresses must first be converted to binary so that the block and word offsets can be determined to see if a cache hit or miss occurs, and if a miss, two words are brought into the cache block.
Web & Social Media Analytics Previous Year Question Paper.pdf
Consider the sequence of word address references in hexadecimal (eigh.pdf
1. Consider the sequence of word address references in hexadecimal (eight in total) shown on the
left side of the following table. Let us assume that the system has a direct mapped cache with
four blocks and two words per block. Fill out the table properly. Hint: first, convert the
hexadecimal addresses into binary. Notice: - The byte-offset field has been removed from these
addresses. In other words, each address specifies one word. - Initially, the cache is empty (entries
are invalid). - When a miss happens, you must bring two words (not one) into the cache. the
memory address shown in the leftmost column (of that row) has been referenced and the possible
miss has been taken care of.