C figure 640 functions that measure and compute read

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 10 9 8 7 6 CHAPTER 6. THE MEMORY HIERARCHY 5 4 3 2 1 0 B. Memory reference: Parameter Cache block offset (CO) Cache set index (CI) Cache tag (CT) Cache hit? (Y/N) Cache byte returned Value 0x 0x 0x 0x Practice Problem 6.12: Repeat Problem 6.10 for memory address 0x1FE4. A. Address format (one bit per box): 12 11 10 9 8 7 6 5 4 3 2 1 0 B. Memory reference: Parameter Cache block offset (CO) Cache set index (CI) Cache tag (CT) Cache hit? (Y/N) Cache byte returned Value 0x 0x 0x 0x Practice Problem 6.13: For the cache in Problem 6.9, list all of the hex memory addresses that will hit in Set 3. 6.4.5 Issues with Writes As we have seen, the operation of a cache with respect to reads is straightforward. First, look for a copy of the desired word Û in the cache. If there is a hit, return word Û to the CPU immediately. If there is a miss, fetch the block that contains word Û from memory, store the block in some cache line (possibly evicting a valid line), and then return word Û to the CPU. 6.4. C...
View Full Document

This note was uploaded on 09/02/2010 for the course ELECTRICAL 360 taught by Professor Schultz during the Spring '10 term at BYU.

Ask a homework question - tutors are online