A direct-mapped cache consists of 8 blocks. A byte-addressable main memory contains 4K blocks of eight bytes each. Access time for the cache is 20 ns and the time required to fill a cache slot from main memory is 300 ns. Assume a request is always started in sequential to cache and then to main memory. If a block is missing from cache, the entire block is brought into the cache and the access is restarted. Initially, the cache is empty.     c) Compute the effective access time for this program.   Show me how to solve using this equation:  EAT = H x AccessC + (1 – H) x  AccessMM where H is the cache hit rate and AccessC and AccessMM are the access times for cache and main memory, respectively.   thanks

17. A file system uses an in-memory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is 1 ms and to read a block from the disk is 10 ms. Assume that the cost of checking whether a block exists in the

When a processor submits a request that cannot be satisfied by the cache, and a block is being pushed back to main memory from the write buffer, should something happen?

If the data being requested is too large to fit in the cache, a write buffer will bring it to the attention of the CPU by retrieving it from main memory. What should the next step be?

HELP WITH PART A,B, AND C

What ought to take place when the CPU issues a request that cannot be satisfied by the cache and a block is being flushed back to main memory from the write buffer?

Oxbe Oxe0 Oxd0 Oxb9 0xe0 Oxc5 Oxdd Ox62 0x73 Oxec Ox6c Oxc9 0x6f Ox94 Ox07 Ox08 Ox3e Oxb2 0x58 0x19 Ox89 0x5c Ox10 0OX88 oxf8 Oxf4 Ox62 0x5f Oxe6 Ox1c Ox66 0xe5 V=1;Tag=0x02; Data = v=1;Tag=0x06; Data = v=1;Tag=0x15; Data = V=0;Tag=0x1a; Data = Ox21 Oxe0 Ox05 0x31 Oxdb Ox30 0x3f 0x81 oxf9 Oxa1 Ox56 0x05 Ox84 Ox68 0xf9 0x78 Oxbd Oxa9 Ox8c Oxc2 oxba Oxe5 Oxe8 Oxac V=1;Tag=0x01; Data = v=1;Tag=0x10; Data = v=1;Tag=0x1d; Data = v=1;Tag=0x0d; Data = 10: Oxba Ox69 0x2c Ox28 Ox64 Oxe4 Ox36 Ox24 ox28 Oxb6 0x2b Ox93 Oxd9 Ox5c Oxb6 0x31 Oxbe Oxd1 Oxfe Ox23 0x13 0x37 0xbb Ox49 ox88 Ox76 Oxee 0x2f Oxao Oxa1 0x1b Ox78 V=1;Tag=0x05; Data = v=1;Tag=0x0f; Data = V=1;Tag=0x13; Data = V=0;Tag=0x1b; Data = Oxob Ox53 Ox26 0xdd Ox3d Oxe9 Ox3f 0x1f Ox02 Ox24 Ox5e Oxef Oxe1 Ox85 Ox33 Oxe3 Ox6e Oxe4 Oxb1 Ox67 Ox6e Oxfb Oxae Ox10 8: !! 9: %3D 11: V=1;Tag=0x1e; Data = v=0;Tag=0x1a; Data = v=1;Tag=0x12; Data = v=1;Tag=0x19; Data = 12: 0x19 0x21 Ox58 Oxfa оx96 Охсе Ох3с Ох23 V=1,Tag=0x1b; Data = V=1;Tag-0x18;…

4

A request that cannot be satisfied in the cache is issued by the processor while the write buffer returns a block to main memory. What should happen in this case?

Computer science Computer organization subject