Please explain in detail every step. Thanks 1. Find the total CPI of a computer system using two-level caching under the following assumptions: • base CPI: 1.2 (including primary cache hit time) primary cache hit rate: 95% • chance of missing both primary and secondary cache: 1% • secondary cache hit time: 5ns • Clock rate: 2GHz • main memory access time: 80ns

Please explain in detail every step. Thanks 1. Find the total CPI of a computer system using two-level caching under the following assumptions: • base CPI: 1.2 (including primary cache hit time) primary cache hit rate: 95% • chance of missing both primary and secondary cache: 1% • secondary cache hit time: 5ns • Clock rate: 2GHz • main memory access time: 80ns

Enhanced Discovering Computers 2017 (Shelly Cashman Series) (MindTap Course List)

1st Edition

ISBN:9781305657458

Author:Misty E. Vermaat, Susan L. Sebok, Steven M. Freund, Mark Frydenberg, Jennifer T. Campbell

Publisher:Misty E. Vermaat, Susan L. Sebok, Steven M. Freund, Mark Frydenberg, Jennifer T. Campbell

Chapter6: Computing Components: Processors, Memory, The Cloud, And More

Section: Chapter Questions

Problem 21CT

See similar textbooks

Similar questions

A direct-mapped cache is designed to store four words per cache line. It has 256 cache lines. Assuming a word is 4 bytes long, what is the length of the tag required for comparison to test for a cache hit or a miss? O 6 O 20 O 4 O 22
A computer has a 256 KB, K-way set associative write-back data cache with block size of 32 B. The address sent to the cache controller by the processor is of 32 bits. In addition to the address tag, each cache tag directory contains 2 valid bits and 1 modified bit. If 16 bits are used to address tag. What is the minimum value of K?
Compute Average Memory Access Time (AMAT) for a system that consists of a 2- level cache design. There the hit rates are 50% for the smaller (L1) cache and 96% for the larger (L2) cache. L1 access time is 1 cycle, L2 access time is 5 cycles, and a memory access time is 20 cycles. Show all the steps.
For a system with single level of cache, define Tc= first-level cache access time= 0.2ns; Tm = memory access time= 0.8ns; H= first-level cache hit ratio. Compute the time for Ta read operation.
The access time of a two-way set-associative cache is 4 nanoseconds, whereas the miss time is 60 nanoseconds. The access latency to main memory was 50 nanoseconds without the cache. Running a series of benchmarks with and without the cache revealed a 90 percent speedup. What is the probability of a hit?
A cache memory system with capacity of N words and block size of B words is to be designed. If it is designed as a direct mapped cache, the length of the TAG field is 14 bits. If it is designed as a 4-way set associative cache, the length of the TAG field will be ………… bits.
1. Determine the number of bits for each cache for the , , and address bits cache size block size cache architecture tag index block offset 32 32 КВ 16 B direct mapped 48 64 KB 8 B 2-way set associative 40 128 KB 32 В 4-way set associative 32 16 KB 16 B fully associative 38 24 KB 16 B 3-way set associative
A main memory sized 8 GByte with 64 words/line is mapped to the following: a- A 16 KByte cache (Direct Mapping) b- A 32 K-line Cache (Direct Mapping) C-A 32kByte Cache (Associative Mapping) In each case, show how a physical address width will be assigned to words, lines, tages when applicable.
Calculate the hit time at L2 cache in a 1.3GHz. processor assuming that the global average memory access time is 5.81 cycles, the hit rate at L1 is 0.91%, the miss penalty at L2 is 88 cycles, the number of misses at L2 is 52 and the number of misses at L1 is 4109. Give the result in ns.
Assume the address format for a fully-associative cache is as follows: 6 bits 2 bits Tag Offset 8 bits Given the cache directory is as shown in the diagram below, indicate whether the memory reference Ox5E results in a cache hits or a miss. Tag valid Block 000 110110 001 000001 010 000010 011 000101 100 001000 1 101 100010 110 010111 111 110110 O Hit O Miss
Given an 8-word, direct mapped cache, and the sequence of address accesses below, enter the number of misses. 6 2 14 20 20 10
Explain why a cache replacement technique for all address sequences is challenging.