By convention, a cache is named according to the amount of data it contains (ie., a 4 KiB cache can hold 4 KiB of data); however, caches also require SRAM to store metadata such as tags and valid bits. For this exercise, you will examine how a cache's configuration affects the total amount of SRAM needed to implement it as well as the performance of the cache. For all parts, assume that the caches are byte addressable, and that addresses and words are 64 bits. 1. Calculate the total number of bits required to implement a 32 KiB cache with two-word blocks. 2. Calculate the total number of bits required to implement a 64 KiB cache with 16-word blocks. How much bigger is this cache than the 32 KiB cache described in Exercise (1) above? (Notice that, by changing the block size, we doubled the amount of data without doubling the total size of the cache.) 3. Explain why this 64 KiB cache, despite its larger data size, might provide slower performance than the first cache. 4. Generate a series of read requests that have a lower miss rate on a 32 KiB two-way set associative cache than on the cache described in Exercise (1) above.
By convention, a cache is named according to the amount of data it contains (ie., a 4 KiB cache can hold 4 KiB of data); however, caches also require SRAM to store metadata such as tags and valid bits. For this exercise, you will examine how a cache's configuration affects the total amount of SRAM needed to implement it as well as the performance of the cache. For all parts, assume that the caches are byte addressable, and that addresses and words are 64 bits. 1. Calculate the total number of bits required to implement a 32 KiB cache with two-word blocks. 2. Calculate the total number of bits required to implement a 64 KiB cache with 16-word blocks. How much bigger is this cache than the 32 KiB cache described in Exercise (1) above? (Notice that, by changing the block size, we doubled the amount of data without doubling the total size of the cache.) 3. Explain why this 64 KiB cache, despite its larger data size, might provide slower performance than the first cache. 4. Generate a series of read requests that have a lower miss rate on a 32 KiB two-way set associative cache than on the cache described in Exercise (1) above.
Chapter11: Operating Systems
Section: Chapter Questions
Problem 2VE
Related questions
Question
![By convention, a cache is named according to the amount of data it contains (ie., a 4 KiB cache can hold
4 KiB of data); however, caches also require SRAM to store metadata such as tags and valid bits. For this
exercise, you will examine how a cache's configuration affects the total amount of SRAM needed to implement
it as well as the performance of the cache. For all parts, assume that the caches are byte addressable, and
that addresses and words are 64 bits.
1. Calculate the total number of bits required to implement a 32 KiB cache with two-word blocks.
2. Calculate the total number of bits required to implement a 64 KiB cache with 16-word blocks. How
much bigger is this cache than the 32 KiB cache described in Exercise (1) above? (Notice that, by
changing the block size, we doubled the amount of data without doubling the total size of the cache.)
3. Explain why this 64 KiB cache, despite its larger data size, might provide slower performance than the
first cache.
4. Generate a series of read requests that have a lower miss rate on a 32 KiB two-way set associative
cache than on the cache described in Exercise (1) above.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F22b6b6a9-48dc-41e2-82df-0b9ee8356514%2F1f2f0866-4ed0-4539-a0ec-a4f4f11301b8%2Fpzngsgk_processed.jpeg&w=3840&q=75)
Transcribed Image Text:By convention, a cache is named according to the amount of data it contains (ie., a 4 KiB cache can hold
4 KiB of data); however, caches also require SRAM to store metadata such as tags and valid bits. For this
exercise, you will examine how a cache's configuration affects the total amount of SRAM needed to implement
it as well as the performance of the cache. For all parts, assume that the caches are byte addressable, and
that addresses and words are 64 bits.
1. Calculate the total number of bits required to implement a 32 KiB cache with two-word blocks.
2. Calculate the total number of bits required to implement a 64 KiB cache with 16-word blocks. How
much bigger is this cache than the 32 KiB cache described in Exercise (1) above? (Notice that, by
changing the block size, we doubled the amount of data without doubling the total size of the cache.)
3. Explain why this 64 KiB cache, despite its larger data size, might provide slower performance than the
first cache.
4. Generate a series of read requests that have a lower miss rate on a 32 KiB two-way set associative
cache than on the cache described in Exercise (1) above.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![Systems Architecture](https://www.bartleby.com/isbn_cover_images/9781305080195/9781305080195_smallCoverImage.gif)
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
![Systems Architecture](https://www.bartleby.com/isbn_cover_images/9781305080195/9781305080195_smallCoverImage.gif)
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning