besign a 256KB (note the B) direct-mapped data cache that uses 32-bit data and address and 8 words per block. Calculate the following: (a) How many bits are used for the byte offset and why? The byte offset needs 5 bits to address each byte offset because 2^5 = 32, (b) How many bits are used for the set (index) field? 13 bits for the set (index) (c) How many bits are used for the tag? 32-13-5=14 bits_ (d) What's the overhead for that cache? 2^13 X 14 = 114688 bits_ (e) How is the address divided, label below?

besign a 256KB (note the B) direct-mapped data cache that uses 32-bit data and address and 8 words per block. Calculate the following: (a) How many bits are used for the byte offset and why? The byte offset needs 5 bits to address each byte offset because 2^5 = 32, (b) How many bits are used for the set (index) field? 13 bits for the set (index) (c) How many bits are used for the tag? 32-13-5=14 bits_ (d) What's the overhead for that cache? 2^13 X 14 = 114688 bits_ (e) How is the address divided, label below?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 30VE

See similar textbooks

Similar questions

6. For a direct mapped cache comprising 16 single word blocks answer the following questions. Assume address and word sizes are both 32 bits and that the memory is byte addressed (4 bytes per 32-bit word). Enter answers as numbers only. How many index bits are there? How many offset bits are there? How many tag bits are there?
Design a 256KB direct-mapped data cache that uses a 32-bit address/data and 8 words per block. Calculate the following: (a) How many bits are used for the byte offset? (b) How many bits are used for the block offset? (c) How many bits are used for the set (index) field? (d) How many bits are used for the tag?
CACHE - SHOW YOUR WORK (Part A) Design a 512KB (note big B) direct-mapped data cache that uses a 32-bit address/data and 8 words per block. Calculate the following: (a) How many bits are used for the byte offset? (b) How many bits are used for the block offset? (c) How many bits are used for the set (index) field? (d) How many bits are used for the tag? (e) What is the physical size of the cache (show as bits/row * # of rows, x * 2v)?
Assume your 32-bit computer (memory address 32-bits) has 16-KB (only L1-data) direct mapped cache. If the cache line size is 64-Bytes how many bits will be used for tag, index and offset? If a memory address is 0x00222222, what will be the tag, index and offset for this address (in binary, hex, decimal)? What will be the total size of cache including tag and V-bit?
For a direct-mapped cache with 64KİB data, 8-word blocks, and 32-bit addresses, answer the following questions: a) What is the number of blocks/lines in the cache? b) Identify the bits in the 32-bit address that are used as index bits? c) Identify the bits in the 32-bit address that are used as tag bits? d) What is the total number of bits in this cache (including tag field and valid field)? e) Identify the block number in the cache to which the following 32-bit memory address maps: Ox00003Z00 (Hexadecimal notation) where Z is the least significant digit in your student ID (written as a decimal number)
Design a direct-mapped cache with 128 KB that uses 32-bits and 16 bytes per block. Calculate: -How many bits are used for the byte offset? -How many bits are used for the index field? -How many bits are used for the tag field?
Assume 32 bit memory addresses , which are byte addresses. You have direct mapped cache with block-size of 8 bytes and size of 128 blocks. How many bits will the index , block offset, and tag be ? How many total bits are required for the cache , including the data ?
Determine which bits in a 32-bit address are used for selecting the byte (B), selecting the word (W), indexing the cache (I), and the cache tag (T), for each of the following caches: A. 64-line, direct-mapped, write-through, 8 byte line
2. A byte-addressable computer uses 32-bit address to access main memory. Suppose the data cache contains 128 blocks and works in4-way set-associative. Each block size is 64B with one "valid" bit. a. How many bits in Tag, Index and Offset? b. Calculate the total cache size (in bits).
Design 64KW, 16-way set associative unblocked cache that has 8 bytes per word. Assume a 64 bit address. Calculate the following: (e) How many bits are used for the byte offset? (f) How many bits are used for the block offset? (g) How many bits are used for the index field? (h) How many bits are used for the tag?
CO. A certain processor uses a fully associative cache of size 16 kB. The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit address. How many bits are required for the Tag and the Index ticlds respectively in the addresses generated by the processor?
Design 128KW, fully associative cache that has 4 32-bit words per block. Assume a 32 bit address. Calculate the following: (i) How many bits are used for the byte offset? (i) How many bits are used for the block offset? (k) How many bits are used for the index field? (1) How many bits are used for the tag?