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 tag | ||||
| # sets in cache | ||||
| # bits (total) per set (including valid and dirty bits) |
Homework Answers
Add Answer to:
Cache question computer architecture
A cache holds 128 words where each word is 4 bytes. Assuming...
1. A cache holds 64 words where each word is 4 bytes. Assume a 32 bit...
1. A cache holds 64 words where each word is 4 bytes. Assume a 32 bit address. There are four different caches a. A direct-mapped cache with block size = 16 words b. 2-way set-associative cache with block size = 8 words c. 4-way set-associative cache with block size=4 words d. A fully associative cache with block size = 16 words. Complete the table for each cache. Cache a Cache be Cache Cache de 16 Number of bits needed for...
Cache of 4096 blocks, a 4-word block size, and a 32-bit address, find the total number...
Cache of 4096 blocks, a 4-word block size, and a 32-bit address, find the total number of sets and the total number of tag bits for caches that are direct mapped, four-way set associative, and fully associative.
Problem 6. Suppose we have a computer with 32 megabytes of main memory, 256 bytes of...
Problem 6. Suppose we have a computer with 32 megabytes of main memory, 256 bytes of cache, and a block size of 16 bytes. For each configuration below, determine the memory address format, indicating the number of bits needed for each appropriate field (i.e. tag, block, set, offset). Show any relevant calculations. Direct cache mapping and memory is byte-addressable a) Direct cache mapping and memory is word-addressable with a word size of 16 bits b) c) 2-way set associative cache...
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
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
10. A 64 K cache has lines that are 128 bytes long, and is 4-way set...
10. A 64 K cache has lines that are 128 bytes long, and is 4-way set associative. The cache is in a computer with a 32-bit address. Answer the following questions: A) How many lines are in the cache? B) How many sets are in the cache? C) How many tags are in the cache? D) How big is each tag? E) If the cache uses an LRU replacement algorithm, how many extra bits will be required to keep track...
Assume a 16-way set associative cache that holds 4096 bytes, where each block is 16 bytes....
Assume a 16-way set associative cache that holds 4096 bytes, where each block is 16 bytes. Assuming an address is 32 bits and that cache is initially empty complete the table below. (You should use hexadecimal numbers for all answers.) Address TAG Cache location (block) | Offset within block OxOFFOFABA 0x00000011 0xOFFFFFFE 0x23456719 OxCAFEBABE Which, if any of the addresses will cause a collision (forcing the block that was just brought in to be overwritten) if they are accessed one...
Text: Explain how a 32-bit byte memory address should be divided into Tag/Index/Offset fields for each...
Text:
Explain how a 32-bit byte memory address should be divided into
Tag/Index/Offset fields for each of the cache configurations below.
Note: 1KB = 210 bytes. You must explain how many bits to assign to
each field and the ordering of the three fields. You get at most
50% of the credit if you give the length of each field without an
explanation.
1) A fully associative cache with cache block size = 2 words and
cache size = 512KB....
question 2 and 3 2. Determine how many sets of cache blocks will be there for...
question 2 and 3
2. Determine how many sets of cache blocks will be there for the following Cache memory size (in bytes) Direct Mapped Blocks Size (in bits) 32 64 218 2-way Set Associative Block Size (in bits) 32 64 A 2A6 [0.5 * 16 = 8] 4-way Set Associative Block Size (in bits) 32 64 SK 64K 256K 3. The physical memory address generated by a CPU is converted into cache memory addressing scheme using the following mapping...
Computer Architecture - Cache Problems 4, Suppose memory addresses are n bits long and the cache...
Computer Architecture - Cache Problems
4, Suppose memory addresses are n bits long and the cache can hold M bytes of data. If the cache block-size is 2 bytes and the cache is k-way set associative, what is the total size of the cache with a write-through policy? How would your answer change, if at all when the cache had a write-back policy?
1. A cache holds 64 words where each word is 4 bytes. Assume a 32 bit address. There are four different caches a. A direct-mapped cache with block size = 16 words b. 2-way set-associative cache with block size = 8 words c. 4-way set-associative cache with block size=4 words d. A fully associative cache with block size = 16 words. Complete the table for each cache. Cache a Cache be Cache Cache de 16 Number of bits needed for...
Problem 6. Suppose we have a computer with 32 megabytes of main memory, 256 bytes of cache, and a block size of 16 bytes. For each configuration below, determine the memory address format, indicating the number of bits needed for each appropriate field (i.e. tag, block, set, offset). Show any relevant calculations. Direct cache mapping and memory is byte-addressable a) Direct cache mapping and memory is word-addressable with a word size of 16 bits b) c) 2-way set associative cache...
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
10. A 64 K cache has lines that are 128 bytes long, and is 4-way set associative. The cache is in a computer with a 32-bit address. Answer the following questions: A) How many lines are in the cache? B) How many sets are in the cache? C) How many tags are in the cache? D) How big is each tag? E) If the cache uses an LRU replacement algorithm, how many extra bits will be required to keep track...
Assume a 16-way set associative cache that holds 4096 bytes, where each block is 16 bytes. Assuming an address is 32 bits and that cache is initially empty complete the table below. (You should use hexadecimal numbers for all answers.) Address TAG Cache location (block) | Offset within block OxOFFOFABA 0x00000011 0xOFFFFFFE 0x23456719 OxCAFEBABE Which, if any of the addresses will cause a collision (forcing the block that was just brought in to be overwritten) if they are accessed one...
Text:
Explain how a 32-bit byte memory address should be divided into
Tag/Index/Offset fields for each of the cache configurations below.
Note: 1KB = 210 bytes. You must explain how many bits to assign to
each field and the ordering of the three fields. You get at most
50% of the credit if you give the length of each field without an
explanation.
1) A fully associative cache with cache block size = 2 words and
cache size = 512KB....
question 2 and 3
2. Determine how many sets of cache blocks will be there for the following Cache memory size (in bytes) Direct Mapped Blocks Size (in bits) 32 64 218 2-way Set Associative Block Size (in bits) 32 64 A 2A6 [0.5 * 16 = 8] 4-way Set Associative Block Size (in bits) 32 64 SK 64K 256K 3. The physical memory address generated by a CPU is converted into cache memory addressing scheme using the following mapping...
Computer Architecture - Cache Problems
4, Suppose memory addresses are n bits long and the cache can hold M bytes of data. If the cache block-size is 2 bytes and the cache is k-way set associative, what is the total size of the cache with a write-through policy? How would your answer change, if at all when the cache had a write-back policy?
Most questions answered within 3 hours.
-
You are a statistician and wish to estimate, with 90%
confidence, the proportion of adults who...
asked 50 minutes ago -
A man is standing 3.40 m in front of a convex spherical mirror
of radius of...
asked 53 minutes ago -
Match the annual percentage rate to each of these trade credit
terms:
__ 1/5, NET 60...
asked 54 minutes ago -
ORGANIC CHEMISTRY QUESTION 5
PART A--------
Describe a chemical test for the identification of a double...
asked 4 hours ago -
Both Terence and Tong work at a local actuarial consulting firm
in Des Moines.
Terence arrives...
asked 4 hours ago -
QUESTION 11
. THE RESTING POTENTIAL IS CAUSED BY
.
. A.
. the rotation of...
asked 4 hours ago -
Need them in c++
1. Give the code for the
definition of a node for
the linked implementation of
a tree that contains...
asked 4 hours ago -
For sputtering-cleaning and sputter-depositing a metal,
would you use an AC or DC plasma? Explain your...
asked 4 hours ago -
Defend ONE of the following statements:
Prices should reflect the value consumers are willing to
pay....
asked 4 hours ago -
A magnet of mass 0.10 kg is dropped from rest and falls
vertically through a 20.0...
asked 4 hours ago -
A friend approaches you about a nutritional product and ask you
if it is worth it....
asked 4 hours ago -
What is bacterial transformation? What are the differences and
similarities between transforming a bacterial cell with...
asked 5 hours ago