
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Concept explainers
Question

Transcribed Image Text:7. Assume a multi-level cache. The L1 cache has a miss-rate of 5%. There is miss penalty of 30 cycles for reaching
the L2 cache. The L2 cache has a miss-rate of 3%. There is a 200 cycle miss penalty for reaching main memory.
What is the average miss penalty for this cache?
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution
Trending nowThis is a popular solution!
Step by stepSolved in 2 steps

Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Replacement Policies Consider a cache using the Least Recently Used (LRU) policy with 16 blocks. If the sequence of memory block accesses is 3, 5, 2, 1, 5, 3, 4, 2, 1, what blocks will be present in the cache after these accesses?arrow_forwardImagine the difference that exists between a cache that is completely associative and one that is directly mapped.arrow_forwardMake the difference between a cache that is directly mapped and one that is totally associative.arrow_forward
- Keep in mind the difference between a fully associative cache and a directly mapped cache.arrow_forwardCache Performance Please answer the following questions regarding average memory access time (AMAT). a. If a specific cache design has 2% miss rate for a set of benchmarks with a hit latency of 20 cycles and a miss penalty of 200 cycles. What is the AMAT for this cache? b. If another cache design has 5% miss rate for the same set of benchmarks with a hit latency of 13 cycles and a miss penalty of 200 cycles. What is the AMAT for this cache? c. Which cache design is better?arrow_forwardIn a split L1 cache organization the I-cache size is 16-KB and the D-cache is 32-KB; the access time for both caches is 1 cycle. The miss rates are given in the table below. There is a 256KB second level cache (L2) that is a unified cache and has a miss rate given in the table. Please assume that miss penalty is 20 cycles to get data from L2 cache. There is a 4MB third level cache (L3) that has a latency of 42 cycles; its miss rate is 1.28%. 124 cycles are required to get data from main memory. A program executes 8.6×10° instructions; 32.8% of the executed instructions are data references (i.e. loads or stores). AMAT = Hit Time + Miss Rate x Miss Penalty Cache miss rates a) Please determine the AMAT for this memory system. [7 points] Cache Size L1 I-Cache L1 D-Cache L2 Unified Cache 8 KB 0.82% 12.21% 8.63% 16 KB 0.38% 11.36% 6.75% L1: I D 32 KB 0.14% 10.67% 5.18% 64 KB 0.06% 10.15% 4.89% L2: U_cache 128 KB 0.03% 9.81% 3.66% 256 KB 0.002% 9.06% 2.76% L3: U_cache M: Mainarrow_forward
- Asap pleasearrow_forwardConsider a 64K L2 memory and a 4K L1 2-way associative cache with block sizes of 512. a. How many blocks are in each set in L1? b. How many offset bits are in the L2 address? c. How many index bits are in the L2 address? d. How many tag bits are in the L2 address?arrow_forwardExplain the differences between a directly mapped cache and a fully associative cache.arrow_forward
- Can I get some help.plzarrow_forwardConsider a cache with 32KİB data, 16-word blocks, and 24-bit addresses, answer the following questions: a) For the direct-mapped configuration, determine the number of index bits and tag bits in the 24-bit address. b) For 4-way set associative configuration, determine the number of index bits and tag bits in the 24-bit address. c) For fully associative contiguration, determine the number of index bits and tag bits in the 24-bit address. d) For an 8-way set associative configuration, identify the set number in the cache to which the following 24-bit memory address maps: Ox001Z00 (Hexadecimal notation) where Z is the least significant digit in your student ID (written as a decimal number)arrow_forwardConsider a 32-bit physical memory space and a 32 KiB 2-way associative cache with LRU replacement. You are told the cache uses 5 bits for the offset field. Write in the number of bits in the tag and index fields. Tag length in bits = Index length in bits =arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education

Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON

Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education