Given a direct-mapped cache that will contain 32,768 bytes of data and four-word blocks (where each...

Question

Question

Given a direct-mapped cache that will contain 32,768 bytes of data and four-word blocks (where each word is 4 bytes) and assuming 32-bit addressing;

1. How many additional bits are required for the overhead associated with the 32,768 bytes of data?
1. What is the overhead (additional space required) for the 32,768 bytes of data, expressed as a percentage?

engineering Computer-Science

Answer 1

Answer #1

since valid bits is not specified,it is not counted. Orelse valid bits are also counted as overhead

please upvote... I need it.. Thanks

Answer 2

Similar Homework Help Questions

A direct- mapped cache holds 1024 (or 2^10) blocks where each block is 1 word. What...

A direct- mapped cache holds 1024 (or 2^10) blocks where each block is 1 word. What is the actual size of one entry in the cache in bits? Assume the address is 32 bits. Include the valid bit and dirty bits in the calculation. 32 54 52 22
a) Suppose we have a 64 KB, direct-mapped cache with 8-word blocks. Determine how many bits...

a) Suppose we have a 64 KB, direct-mapped cache with 8-word blocks. Determine how many bits are required for the tag, index, and offset fields for a 32-bit memory address. b) If instead, we use a 64 KB, 4-way set-associative cache with 8-word blocks, how many bits will be required for the tag, index, and offset fields for a 32-bit address? c) What type of cache is shown in problem 2? How many bits are required for this cache’s tag,...
A direct-mapped cache has 4 blocks and each block holds four bytes of data. The memory...

A direct-mapped cache has 4 blocks and each block holds four bytes of data. The memory system is byte-addressable. Determine if each of the memory references below is a hit (H) or miss (M). You assume the cache is initially empty and memory references are given in decimal. 12 21 13 32 27 23 34 19 34 23 36 39 REFE RENC E H/M2 I

Cache question computer architecture A cache holds 128 words where each word is 4 bytes. Assuming...

Cache question computer architecture A cache holds 128 words where each word is 4 bytes. Assuming a 32-bit address, for each of the following organizations, complete the table. a.A direct-mapped cache with block size = 16words b.2-way set-associative cache with block size = 8words c.4-way set-associative cache with block size = 4words d.A fully associative cache with block size = 2words. Cache a Cache b Cache c Cache d total # bits for word & byte displacement # bits in...
A direct-mapped cache has 4 blocks and each block holds four bytes of data. The memory...

A direct-mapped cache has 4 blocks and each block holds four bytes of data. The memory system is byte-addressable. Determine if each of the memory references below is a hit (H) or miss (M). You assume the cache is initially empty and memory references are given in decimal. Reference 27 0 13 24 50 24 36 14 48 45 47 48 H/M?
For a 16K-byte, direct-mapped cache, suppose the block size is 32 bytes, draw a cache diagram....

For a 16K-byte, direct-mapped cache, suppose the block size is 32 bytes, draw a cache diagram. Indicate the block size, number of blocks, and address field decomposition (block offset, index, and tag bit width) assuming a 32-bit memory address.

Lab 8 final report A direct-mapped cache has 4 blocks and each block holds four bytes...

Lab 8 final report A direct-mapped cache has 4 blocks and each block holds four bytes of data. The memory system is byte-addressable. Determine if each of the memory references below is a hit (H) or miss (M). You assume the cache is initially empty and memory references are given in decimal. 12 21 13 32 27 23 34 19 34 23 36 39 REFE RENC E H/M? I
Consider a direct-mapped cache with 32 blocks Cache is initially empty, Block size = 16 bytes...

Consider a direct-mapped cache with 32 blocks Cache is initially empty, Block size = 16 bytes The following memory addresses (in hexadecimal) are referenced: 0x2B4, 0x2B8, 0x2BC, 0x3E8, 0x3EC,0x4F0, 0x8F4, 0x8F8, 0x8FC. Map addresses to cache blocks and indicate whether hit or miss
Assume a cache with 2048 blocks, a 4-word block size, and a 32-bit address. For each...

Assume a cache with 2048 blocks, a 4-word block size, and a 32-bit address. For each of the following configurations, find the total number of bits for each cache block and the total numbers of bits for the entire cache. a. Direct-mapped b. Two-way set associative c. Four-way set associative d. Fully-associative

Assuming a direct-mapped cache with 4 four-word blocks that is initially empty, label each reference in...

Assuming a direct-mapped cache with 4 four-word blocks that is initially empty, label each reference in the list as a hit or a miss and show the final contents of the cache. The following is a sequence of address references given as word addresses. 1, 5, 8, 4, 17, 19, 20, 6, 9, 8, 43, 5, 6, 21, 9, 17 Reference Hit or Miss Miss 17 19 20 43 Wordo Wordi Word2 Word 3 Block