given a 32 bit byte addressable machine let us suppose we have the following byte ad 5151653


02) Given a 32 bit byte addressable machine. Let us suppose we have the following byte address accesses 0, 1,2,3,8,9,10,11,4,5,6,7,12,13,14,15,0,1,2,3,4.5,6.7,8. tive cache in which block size is 1 word and can store a ume we have a LRU (least recently used) based a) Given a 2-way set associa cache replacement policy. For each access indicate whether it is a hit or miss and the state of the cache. For the s total number of 8 words. Assume we have a cache e state of the cache. For the state of the cache you can just notate the word 10 Points Please use the table provided. Redo the same calculation for a 4 way set associati capacity and block size . . . . . … … b) 10 Points Please use the table provided. Given a 32 bit byte addressable machine. Let us suppose we have the following byte address accesses 0, 1, 2, 3, 8, 9, 10, 11, 4, 5, 6, 7, 12, 13, 14, 15, 0, 1, 2, 3, 4.5, 6.7, 8. Given a 2-way set associative cache in which block size is 1word and can store a total number of 8 words, Assume we have a LRU (least recently used) based cache replacement policy. For each access indicate whether it is a hit or miss and the state of the cache. For the state of the cache you can just notate the word address at each location b) Redo the same calculation for a 4 way set associative cache with the same total capacity and block size

"Get 15% discount on your first 3 orders with us"
Use the following coupon
FIRST15

Order Now