For the subsequent problems, A through F, words are assumed to be 4 bytes, and the...
For these problems, words are assumed to be 4 bytes, and the references are word-addresses. Thus, the words in memory are located in word-addresses 0, 1, 2, ... As a comparison, note that byte-addresses for words are multiples of 4. Thus, the byte-addresses for words are 0, 4, 8, 12,.... Note that the caches have a cache-line of two-words. We can write a 2-word block as follows (0,1), (2,3), etc are blocks 0, 1, ... Problem B (1 pts). Assume...
1. A cache holds 64 words where each word is 4 bytes. Assume a 32 bit address. There are four different caches a. A direct-mapped cache with block size = 16 words b. 2-way set-associative cache with block size = 8 words c. 4-way set-associative cache with block size=4 words d. A fully associative cache with block size = 16 words. Complete the table for each cache. Cache a Cache be Cache Cache de 16 Number of bits needed for...
Here is a series of address references given as word addresses: 1, 4, 8, 5, 20, 17, 19, 56, 9, 11, 4, 43, 5, 6, 9, 17. For each of the following cache design, label each reference as a hit or a miss and show the final contents of the cache. Assume the caches are initially empty. - Direct mapped with four-word blocks and total size of 16 words.
Consider a hypothetical machine with 1K words of cache memory. They are iin direct-mapped organization, with cache block size of 128 words, using LRU replacement algorithm. Suppose the cache hit time is 8ns, the time to transfer the first word from main memory to cache is 50ns, while subsequent words require 10ns/word. Consider the following read pattern (in blocks of 128 words, and block id starts from 0): 1 2 3 5 6 2 3 4 9 10 11 6...
Cache question computer architecture A cache holds 128 words where each word is 4 bytes. Assuming a 32-bit address, for each of the following organizations, complete the table. a.A direct-mapped cache with block size = 16words b.2-way set-associative cache with block size = 8words c.4-way set-associative cache with block size = 4words d.A fully associative cache with block size = 2words. Cache a Cache b Cache c Cache d total # bits for word & byte displacement # bits in...
Here is a series of address references given as word addresses: 2, 3, 11, 16, 21, 13, 64, 48, 19, 11, 3, 22, 4, 27, 6, and 11. Using this references, show the hits and misses and the final cache contents for direct-mapped cache with one-word blocks and a total size of 16 words.
A direct-mapped cache has 4 blocks and each block holds four bytes of data. The memory system is byte-addressable. Determine if each of the memory references below is a hit (H) or miss (M). You assume the cache is initially empty and memory references are given in decimal. Reference 27 0 13 24 50 24 36 14 48 45 47 48 H/M?
Consider a cache of 8 lines of 16 bytes each. Main memory is divided into blocks of 16 bytes each. That is, block 0 has bytes with addresses 0 through 15, and so on. Now consider a program that accesses memory in the following sequence of addresses: Loop three times: 10 through 20; 32 through 52. Once: 20 through 35. Suppose the cache is organized as direct mapped. Memory blocks 0, 8, 16 and so on are assigned to line...
2. A computer uses a memory with addresses of 8 bits. (What's the size of the MM?) This computer has a 16-byte cache with 4 bytes per block. (How many blocks in the cache?) The computer accesses a number of memory locations throughout the course of running a program. Suppose this computer uses direct-mapped cache. a. What's the format of a memory address as seen by the cache ? Tag ? bits Block ? bits Offset ? bits b. The...
Consider a hypothetical machine with 1K words of cache memory. They are iin direct-mapped organization, with cache block size of 128 words, using LRU replacement algorithm. Suppose the cache hit time is 8ns, the time to transfer the first word from main memory to cache is 50ns, while subsequent words require 10ns/word. Consider the following read pattern (in blocks of 128 words, and block id starts from 0): 1 2 3 5 6 2 3 4 9 10 11 6...