Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

3. Assume we have a 4-way set associative cache with 16 byte blocks (Memory is byte addressable). The cache uses a Least Recently Used replacement

3. Assume we have a 4-way set associative cache with 16 byte blocks (Memory is byte addressable). The cache uses a Least Recently Used replacement policy and write back write policy. For simplicity, we will say the total cache size is 128 bytes. Answer the following questions about this cache. Assume each address is 8 bits total. Show work.

3.1 How long is the tag field of this cache?

3.2 How long is the index field of this cache?

3.3 How long is the block offset of this cache?

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Genomes Browsers And Databases Data Mining Tools For Integrated Genomic Databases

Authors: Peter Schattner

1st Edition

0521711320, 978-0521711326

More Books

Students also viewed these Databases questions