- A Computer System Has A Word Addressable Main Memory Consisting Of 256k X Bit Words It Also Has A 4k Word Cache Organiz 1 (72.12 KiB) Viewed 16 times
A computer system has a word-addressable main memory consisting of 256K X-bit words. It also has a 4K-word cache organized in a set associative manner with 4 block frames per set and 64-words per block. The cache is Y times faster than main memory. Assume the cache is initially empty. Suppose the CPU fetches 3584 words from locations 0,1,2,3..., 3583 in order. It then repeats this fetch sequence 14 more times. Assume no interleaved memory and no read-through policy. Assuming the LRU algorithm is used for block replacement, estimate the speedup (ratio of time without cache to time with cache) resulting from use of the cache.