Computer Systems: A Programmer's Perspective (3rd Edition)
3rd Edition
ISBN: 9780134092997
Author: Bryant
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 6, Problem 6.33HW
Program Plan Intro
Given Information:
A 4-way set associative cache is given:
Index | Tag | V | Bytes 0-3 | Tag | V | Bytes 0-3 | Tag | V | Bytes 0-3 | Tag | V | Bytes 0-3 |
0 | F0 | 1 | ED 32 0A A2 | 8A | 1 | BF 80 1D FC | 14 | 1 | EF 09 86 2A | BC | 0 | 25 44 6F 1A |
1 | BC | 0 | 03 3E CD 38 | A0 | 0 | 16 7B ED 5A | BC | 1 | 8E 4C DF 18 | E4 | 1 | FB B7 12 02 |
2 | BC | 1 | 54 9E 1E FA | B6 | 1 | DC 81 B2 14 | 00 | 0 | B6 1F 7B 44 | 74 | 0 | 10 F5 B8 2E |
3 | BE | 0 | 2F 7E 3D A8 | C0 | 1 | 27 95 A4 74 | C4 | 0 | 07 11 6B D8 | BC | 0 | C7 B7 AF C2 |
4 | 7E | 1 | 32 21 1C 2C | 8A | 1 | 22 C2 DC 34 | BC | 1 | BA DD 37 D8 | DC | 0 | E7 A2 39 BA |
5 | 98 | 0 | A9 76 2B EE | 54 | 0 | BC 91 D5 92 | 98 | 1 | 80 BA 9B F6 | BC | 1 | 48 16 81 0A |
6 | 38 | 0 | 5D 4D F7 DA | BC | 1 | 69 C2 8C 74 | 8A | 1 | A8 CE 7F DA | 38 | 1 |
FA 93 EB 48 |
7 | 8A | 1 | 04 2A 32 6A | 9E | 0 | B1 86 56 0E | CC | 1 | 96 30 47 F2 | BC | 1 | F8 1D 42 30 |
- The number of physical address bits is represented by “m”.
- The size of cache represented is by “C”.
- The block of size in bytes is represented as “B”.
- Associativity is represented as “E”.
- The number of cache sets is represented by “S”.
- The number of tag bits is represented by “t”.
- The number of block offset bits is represented as “b”.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
If memory read cycle takes 100 ns and a cache read cycle takes 20 ns, then for four
continuous references, the first one brings the main memory contents to cache and the next
three from cache. Find the time taken for the Read cycle with and without Cache? What is
the Percentage speedup obtained?
A cache has been designed such that it has 512 lines, with each line or block containing 8 words. Identify the line number, tag, and word position for the 20- bit address 3A45616 using the direct mapping method.
For the main memory address FEDCBAH, show the following information in hexadecimal format:
1)Tag, Line, and Word values for a direct-mapped cache
2)Tag and Word values for an associative cache
3)Tag, Set, and Word values for a two-way set-associative cache
Chapter 6 Solutions
Computer Systems: A Programmer's Perspective (3rd Edition)
Ch. 6.1 - Prob. 6.1PPCh. 6.1 - Prob. 6.2PPCh. 6.1 - Prob. 6.3PPCh. 6.1 - Prob. 6.4PPCh. 6.1 - Prob. 6.5PPCh. 6.1 - Prob. 6.6PPCh. 6.2 - Prob. 6.7PPCh. 6.2 - Prob. 6.8PPCh. 6.4 - Prob. 6.9PPCh. 6.4 - Prob. 6.10PP
Ch. 6.4 - Prob. 6.11PPCh. 6.4 - Prob. 6.12PPCh. 6.4 - Prob. 6.13PPCh. 6.4 - Prob. 6.14PPCh. 6.4 - Prob. 6.15PPCh. 6.4 - Prob. 6.16PPCh. 6.5 - Prob. 6.17PPCh. 6.5 - Prob. 6.18PPCh. 6.5 - Prob. 6.19PPCh. 6.5 - Prob. 6.20PPCh. 6.6 - Prob. 6.21PPCh. 6 - Prob. 6.22HWCh. 6 - Prob. 6.23HWCh. 6 - Suppose that a 2 MB file consisting of 512-byte...Ch. 6 - The following table gives the parameters for a...Ch. 6 - The following table gives the parameters for a...Ch. 6 - Prob. 6.27HWCh. 6 - This problem concerns the cache in Practice...Ch. 6 - Suppose we have a system with the following...Ch. 6 - Suppose we have a system with following...Ch. 6 - Suppose that a program using the cache in Problem...Ch. 6 - Repeat Problem 6.31 for memory address0x16E8 A....Ch. 6 - Prob. 6.33HWCh. 6 - Prob. 6.34HWCh. 6 - Prob. 6.35HWCh. 6 - Prob. 6.36HWCh. 6 - Prob. 6.37HWCh. 6 - Prob. 6.38HWCh. 6 - Prob. 6.39HWCh. 6 - Given the assumptions in Problem 6.38, determine...Ch. 6 - You are writing a new 3D game that you hope will...Ch. 6 - Prob. 6.42HWCh. 6 - Prob. 6.43HWCh. 6 - Prob. 6.45HWCh. 6 - Prob. 6.46HW
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
- "Hadley cache" and "unified cache" need to be described in terms of what they mean.arrow_forward- A cache has been designed such that it has 1024 lines, with each line or block containing 8 words. Determine the line number, tag, and word position for the 20-bit address 3E9D216 using the direct mapping method.arrow_forwardA virtual address of 32 bits is passed on to the TLB. If the number of entries (number of cache lines) in the TLB are 32, what is the width of the Tag field in the TLB?arrow_forward
- 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.) Show the main memory address format that allows us to map addresses from main memory to cache. Be sure to include the fields as well as their sizes.arrow_forwardGive a brief summary of the cache protocol.arrow_forwardThe hit rate of the memory closest to the ALU is increased from 75% to 80% in a practical cache memory hierarchy. The hit latency (or hit time) for the closest memory is 20ps, while the miss latency is 20ns. What would the expected reduction in the average memory access latency be?arrow_forward
- In an x86-64 system, how many shorts can be stored in a cache block if your cache is 8KB (total addressable locations in cache), is 4-way set-associative, and contains 32 sets? Question 3 options: 8 16 32 64arrow_forwardThe phrases "unified cache" and "Hadley cache" should be defined.arrow_forwardA 64 KB 2-way set-associative cache is byte-addressable and contains 32 byte lines. Memory addresses are 64-bit wide.How wide are the tags in this cache?arrow_forward
- Suppose we have a 16KB direct-mapped data cache with 4-byte blocks.Show how a 32-bit memory address is divided into tag, index and offset.Show clearly how many bits are in each field.arrow_forwardFor a system with single level of cache, define Tc= first-level cache access time; Tm = memory access time;H= first-level cache hit ratio. Provide an equation for Ta for a read operation.arrow_forwardWhat challenges must be overcome in order to design a technique for replacing cache that is compatible with any particular address sequence?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage LearningEnhanced Discovering Computers 2017 (Shelly Cashm...Computer ScienceISBN:9781305657458Author:Misty E. Vermaat, Susan L. Sebok, Steven M. Freund, Mark Frydenberg, Jennifer T. CampbellPublisher:Cengage Learning
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Enhanced Discovering Computers 2017 (Shelly Cashm...
Computer Science
ISBN:9781305657458
Author:Misty E. Vermaat, Susan L. Sebok, Steven M. Freund, Mark Frydenberg, Jennifer T. Campbell
Publisher:Cengage Learning