I haveĪssumed each word is 32 bits long, and that the memory is byte addressable:įully associative cache: 4 1-word blocks in one set:Ĭonsidering a byte-addressable memory and assuming that theĪddresses given refer to byte addresses, we can conclude that the byte offset Solution provided only for case a fully associative cache. Using this policy, the block that has been least recently used will be Find the number of misses for each cache organization givenĠ, 15, 25, 8, 0, 12, 14, 6, 0, 8. OneĬache is fully associative, a second in two-way set associative, and the third There are three small caches, each containing four one-word blocks. Here is the cache after all addressesĭata from memory block with tag 354h and index 2ĭata from memory block with tag 355h and index 2ĭata from memory block with tag 5fe6h and index 2ĭata from memory block with tag 9ffbh and index 2ģ. Offset bits (5bits), and then find index and tag. You need to solve it for other parts as well.įor this problem you need to convert the hex address to binary, remove byte Show the initial and final states of the cache. In your cache of problem 1(a), what will be the tags in the set(s) thatĬontains these references at the end of the sequence? Assume some initial Consider the following sequence of 5 addresses (in hex.): In a direct-mapped cache each block corresponds to one set. Parts in problem 1, we have a totla of 64 * 4 = 256īlocks. Hence, no index isĬ) Repeat part (a), for a direct-mapping cache with same number of blocksĪssuming that the size of the cache (in blocks is fixed) for all Show how the 28-bit physical address is treated in performing aī) Repeat part (a), for a fully associative cache with same number of blocksĪ fully associative cache has only one set. Of the four block(lines) in a set containing 32 bytes. Design a 4-way set associative cache with each a) The instruction set for a computer uses 28-bit addresses, with eachĪddressable unit being a byte.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |