Given a 2-way set-associative cache with 2 entries (sets) and 1 byte block size (no offset), what is the LRU value of each entry (set) after the following processor access sequence? Assume the LRU bits of both entries are set to 0 initially. Processor accesses: 10000, 10001, 11101, 11011, 11110 LRU (entry 0) = _ LRU (entry 1) = O 1,0 O 0,0 O 0, 1 O 1,1

Given a 2-way set-associative cache with 2 entries (sets) and 1 byte block size (no offset), what is the LRU value of each entry (set) after the following processor access sequence? Assume the LRU bits of both entries are set to 0 initially. Processor accesses: 10000, 10001, 11101, 11011, 11110 LRU (entry 0) = _ LRU (entry 1) = O 1,0 O 0,0 O 0, 1 O 1,1

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

Assume a cache system has been designed such that cach block contains 4 words and the cache has 1024 lines, the cache can store up 10 1024 blocks. What line of the cache is supposed 10 hold the block that contains the word from the twenty-bit address JA456:? In addition, what is the tag number that will be stored with the block?
For a direct-mapped cache design with a 32-bit address, the following bits of the address areused to access the cache.Tag Index Offset31–10 9–6 5–0a– What is the cache block size (in words)? b – How many entries does the cache have? c – What is the ratio between total bits required for such a cache implementation overthe data storage bits?
For a 16-word cache, consider the following repeating sequence of lw addresses (given in hexadecimal below): 00 04 18 1C 40 48 4C 70 74 80 84 7C A0 A4
Consider a direct-mapped cache memory with 12-bit addresses. The cache is byte-addressable. We have B = 16 bytes per block and S = 8 sets. For the address shown below. Indicate which bits correspond to the cache set index, tag bits, and block offset. Bit 11 Bit 10 Bit 9 Bit 8 Bit 7 Bit 6 Bit 5 Bit 4 Bit 3 Bit 2 Bit 1 Bit 0
For a direct-mapped cache design with a 32-bit address, the following bits of the address are used to access the cache.Tag Index Offset31–10 9–5 4–01. What is the cache block size (in words)?2. How many entries does the cache have?3. What is the ratio between total bits required for such a cache implementation over the data storage bits?Starting from power on, the following byte-addressed cache references are recorded. Address 0 4 16 132 232 160 1024 30 140 3100 180 2180 How many blocks are replaced? What is the hit ratio? List the fi nal state of the cache, with each valid entry represented as a record of <index, tag, data>
A computer using direct mapping cache has 256Mbytes of byte addressable main memory and cache size of 32k lines and each cache block contain 8 bytes. How many blocks of main memory are there?What are the size of the tag, line number and words?To which cache block will the memory address 13ADEF9H map?To which line number will the memory address 17FEAD8H map?
Consider a cache with the following parameters: N (associativity) = 2, b (block size) = 2 words, W (word size) = 32 bits,C (cache size) = 32 K words, A (address size) = 32 bits. You need consider only word addresses.(a) Show the tag, set, block offset, and byte offset bits of the address. State how many bits are needed for each field.(b) What is the size of all the cache tags in bits?(c) Suppose each cache block also has a valid bit (V) and a dirty bit (D). What is the size of each cache set, including data, tag, and status bits?(d) Design the cache using the building blocks in Figure 8.28 and a small number of two-input logic gates. The cache design must include tag storage, data storage, address comparison, data output selection, and any other parts you feel are relevant. Note that the multiplexer and comparator blocks may be any size (n or p bits wide, respectively), but the SRAM blocks must be 16K × 4 bits. Be sure to include a neatly labeled block diagram. You need only design the…
Consider a four-way set associative cache comprised of 64-bit words. The number of sets is 4096 and the number of words per line is 8. What is the size of the cache?
For a direct-mapped cache design with a 32-bit address, the following bits of the address are used to access the cache: Tag Index Offset 31-10 9-6 5-0 1. What is the cache block size (in words)? 2. How many entries does the cache have? 3. What is the ratio between total bits required for such a cache implementation over the data storage bits?
Consider a cache with a line size of 32 bytes and a main memory that requires 30 ns to transfer a 4-byte word. For any line that is written at least once before being swapped out of cache , what is the average number of times that the line must be written before being swapped out for a write back cache to be more efficient that a write-through cache?
Take into consideration the difference between a fully associative cache and a directly mapped cache.
A cache designer wants to increase the size of a 4 KiB virtually indexed, physically tagged cache. Given the page size shown above, is it possible to make a 16 KiB direct-mapped cache, assuming 2 words per block? How would the designer increase the data size of the cache?