cache, 20 ns are required to load it into the L2-cache and reference is started again Main memory but not in the cache, 60 ns are required to load it into the L3-cache and reference is started again The L1-cache hit ratio is 0.9, L2-cache hit ratio is 0.8, and L3-cache hit ratio is 0.6 a.If the word is found in L1 cache, how much is the access time? b.If the word is found in L2 cache, how much is the access time? c.What is the average time in nanoseconds

cache, 20 ns are required to load it into the L2-cache and reference is started again Main memory but not in the cache, 60 ns are required to load it into the L3-cache and reference is started again The L1-cache hit ratio is 0.9, L2-cache hit ratio is 0.8, and L3-cache hit ratio is 0.6 a.If the word is found in L1 cache, how much is the access time? b.If the word is found in L2 cache, how much is the access time? c.What is the average time in nanoseconds

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 26VE

See similar textbooks

Similar questions

In a Direct Mapped Cache Memory Physical Address format the Cache line offset field size and word offset field size are same (with word size of one Byte). The number of tag bits in the Physical Address format is equal to the number of blocks in Cache Memory. If the Tag field Size is Mega words. 16 bits, the size of the physical Memory is
A cache is set up with a block size of 32 words. There are 64 blocks in cache and set up to be 4-way set associative. You have byte address 0x8923. Show the word address, block address, tag, and index Show each access being filled in with a note of hit or miss. You are given word address and the access are: 0xff, 0x08, 0x22, 0x00, 0x39, 0xF3, 0x07, 0xc0.
Cache memory systems are designed such that the computer first checks the L1 cache for the desired memory. If the data is there, it accesses it and is done. It only checks the L2 cache if the data is not found in the L1 cache. Likewise, the computer checks the L3 cache if the desired data is not found in the L2 cache, and finally it on only checks main memory if the data is not found in the L3 cache. Imagine a computer system with the following cache access times: L1 cache: 3 processor cycles L2 cache: 10 processor cycles L3 cache: 25 processor cycles Main memory: 100 processor cycles So, in the best case, the desired data would be immediately found in the L1 cache, which requires only 3 cycles to check. Conversely, in the worst case, the desired data would only be in main memory, which would require 138 cycles to access (3 cycles to check L1 cache + 10 cycles to check L2 + 25 cycles to check L3 + 100 cycles to access main memory). What is important, however, is the average…
A cache system is to be designed to store data from a 256 MB memory space. If each block of main memory contains 16 words, determine the number of blocks that are needed and draw the logical organization of the full address identifying the block ID portion and the word (offset) portion
A direct-matched cache has a structure where the first (left) 12 bits are the label, the next 15 are the line, and the last 5 are the word. In which line the address 1878112 should be stored? a) 32167 b) 572 c) 14988 d) 25923
For a direct-mapped cache design with a 32-bit address, the following bits of the address are used to access the cache. We assume that each word has 4 bytes. How many entries does the cache have?
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.
A microprocessor with 32-bit address bus has an on-chip 16-KByte four-way set-associative cache memory, the line size is 4 bytes. Draw a block diagram of this cache showing its Organization and how the different address fields are used to determine a cache hit/miss. Where in the cache is the word from memory location ABCDE8F8 mapped?
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
A 2-way set-associative cache consists of four sets. Main memory contains 2K blocks of 8 bytes each and byte addressing is used.Q.) Compute the hit ratio for a program that loops three times from addresses 0x8 to 0x33 in main memory. You may leave the hit ratio in terms of a fraction.
A computer has a L1-cache, L2-cache, main memory, and a disk used for virtual memory. If a referenced word is in the -•L1-Cache, 20 ns are required to access it •L2-Cache, but not in the L1 cache, 40 ns are required to load it into the L1-cache and reference is started again -Main memory but not in the cache, 60 ns are required to load it into the cache and reference is started again -Hard disk but not in the main memory, 12 ms are required to fetch the word from the disk, followed by 60 ns to copy to the cache, and then the references starts again -The L1-cache hit ratio is 0.9, L2-cache hit ratio is 0.8, and the main memory hit ratio is 0.6 s What is the average time in nanoseconds required to access a referenced word on this system?
A certain processor deploys a single-level cache. The cache block size is 16 words and the word size is 4 bytes. The memory system uses a 100- MHz clock. To service a cache miss, the memory controller first takes 1 cycle to accept the starting address of the block, it then takes 5 cycles to fetch all the sixteen words of the block, and finally transmits the words of the requested block at the rate of 2 cycle per word. The maximum bandwidth for the memory system when the program running on the processor issues a series of read operations is 107 bytes/sec. X