Caches are important to providing a high-performance memory hierarchy to processors. Below is a sequence of ten memory references in binary to an empty eight- one word block cache. 10110,11010,10110,11010, 10000, 00011, 10000, 10010, 10000, 10111 For each of these references tabulate the tag, valid bit status, the index, and the data given a direct-mapped cache. Also list if each reference is a hit or a miss, assuming the cache is initially empty.

Caches are important to providing a high-performance memory hierarchy to processors. Below is a sequence of ten memory references in binary to an empty eight- one word block cache. 10110,11010,10110,11010, 10000, 00011, 10000, 10010, 10000, 10111 For each of these references tabulate the tag, valid bit status, the index, and the data given a direct-mapped cache. Also list if each reference is a hit or a miss, assuming the cache is initially empty.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 21VE

See similar textbooks

Similar questions

3. The series of memory address references given as word addresses are 122, 126, 126, 126, 116, 300, 116, and 118. Assume a direct-mapped cache with eight one-word blocks that is initially empty. Label each reference in the list as a hit or miss and show the contents of the cache with figure after each reference.
A direct-mapped cache consists of 16 blocks. A byte-addressable main memory contains 4K blocks of 16 bytes each. Access time for the cache is 30 ns and the time required to fill a cache slot from main memory is 250 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. a) 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. b) Compute the hit ratio for a program that loops 4 times from locations 0 to 42 (base 10) in memory. c) Compute the effective access time for this program.
Suppose a computer using fully associative cache has 220220 words of main memory and a cache of 128 blocks, where each cache block contains 16 words. (a) How many blocks of main memory are there? (b) What is the format of a memory address as seen by the cache, that is, what are the sizes of the tag and word fields? (c) To which cache block will the memory reference 01D872_{16}01D872_{16} map?
2-Caches are important to providing a high-performance memory hierarchy to processors. Below is a list of 32-bit memory address references, given as word addresses. a. For each of these references, identify the binary address, the tag, and the index given a direct-mapped cache with two-word blocks and a total size of 4 blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty. 42, 180, 46, 185, 189, 3, 181, 43, 6, 189, 65, 190 b. For each of these references, identify the binary address, the tag, and the index given a direct-mapped cache with four-word blocks and a total size of 4 blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty. c. For each of these references, identify the binary address, the tag, and the index given a two way associative cache with two-word blocks and a total size of 4 blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty d. For each of these…
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? Tag Index Offset Block offset | Byte offset 31–12 11-6 5-2 1-0
For a direct-mapped cache design with 64-bit addresses, the following bits of the address are used to access the cache: Tag Index Offset 63-13 12-4 3-0 a. What is the cache block size (in bytes)?b. What is the cache size (in bytes)?c. What is the total number of bits (including valid bit, tag bits and data array bits) to implement this cache?d. For the same block and cache sizes, you want to implement a 4-way set-associative cache, what is the number of index bit and the number of tag bits?
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
For a direct-mapped cache design with a 64-bit address, the following bits of the address are used to access the cache. Tag Index Offset 63-9 8-5 4-0 Beginning from power on, the following byte-addressed cache references are recorded. Нех 00 04 10 84 E8 AO 400 1E 8C Cic B4 884 (A) For cach reference, list (i) its teg, index, end offset, (ii) whether it is a hit or a miss, and (iii) which bytes were replaced (if any). (B) what is the hit ratio? (C) List the final state of the cache, with each valid entry represented as a record of . For example,
For a direct-mapped cache design with a 32-bit address, the following bitsof the address are used to access the cache. Use the table below. a. What is the cache block size (in words)?b. How many entries does the cache have?c. What is the ration between total bits required for such a cache implementation overthe data storage bit?
Suppose a computer using direct mapped cache has 232 byte of byte-addressable main memory, and a cache of 1024 blocks, where each cache block contains 32 bytes. a) How many blocks of main memory are there? b) What is the format of a memory address as seen by the cache, i.e., what are the sizes of the tag, block, and offset fields? c) To which cache block will the memory address 0x000063FA map?
For a direct-mapped cache design with a 32-bit address, the following bits of the address are used to access the cache. Tag 31-10 Index 9-5 a. What is the cache block size (in words)? b. How many entries does the cache have? Offset 4-0 c. What is the ratio between total bits required for such a cache implementation over the data storage bits?
In the event that a request cannot be fulfilled by the cache, the processor will submit a request to main memory while the write buffer delivers the relevant data block. What steps need to be taken here?