For a tiny memory system with 32 bytes of memory, 4 byte cache blocks of fully-a

Question

For a tiny memory system with 32 bytes of memory, 4 byte cache blocks of fully-associative cache, and 8 bytes of cache:

Draw a diagram of the cache memory system that shows:

Memory Addresses for each of the 32 bytes (in binary)

The cache structure

The memory address structure with the number of bits for each piece of the address

What is compared to what when checking for an address in the cache.

Now populate your memory with the lower case letters of the alphabet, followed by digits, both in ascending order. Start the population with the first (lowest address) memory location.

Now load the cache with the first and fourth memory blocks.

The CPU generates address 01101. Is it in the cache? Explain what the CPU does to determine this.

If the memory block is currently in the cache, what character is found at the above address?

Explanation / Answer

Memory Address for Each 32 Bytes:

Cache structure:

Each block can be mapped to any line as fully-associative.

What is compared to what when checking for an address in the cache:

As mapping is fully associtive, when CPU generate an address,each block in cache memory is compared againt generated address. There is no need to index here as every block can occupy any line, hence all lines need to be checked eliminating index role.

CPU address 01101 does not exist within this memory strcuture. Invalid Address error will be thrown.

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.