Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Please read the question properly. Don't copy from other posts. Here memory address is (2, 3, 170, 45, 7,196, 189, 191, 215,172, 45, 187, 254)

image text in transcribed

Please read the question properly. Don't copy from other posts. Here memory address is (2, 3, 170, 45, 7,196, 189, 191, 215,172, 45, 187, 254) not (1, 4, 181,44,3,192,89,191,15,172,45,187,254 ). Keep it in mind. Thank you

1. Suppose, we have a direct cache with a size of 16 blocks and each block can hold 1 word and the memory address is 32-bit and is initially empty. Now below is a list the 32-bit memory addresses that the processor wants to access provided in decimal: 2, 3, 170, 45, 7,196, 189, 191, 215,172, 45, 187, 254 Now answer the following questions: A. For each of these references, identify the binary address, the tag, and the index given a direct-mapped cache with 16 one-word blocks. Also mention if each reference is a hit or a miss, assuming the cache is initially empty. Show all the accesses in a tabular manner where the table contains index, valid bit, tag field and data field. [7 Marks] B. Calculate the Hit Ratio and Miss Ratio for provided memory access. [2 Marks] C. Calculate the total number of bits required for the cache listed above, assuming a 32-bit address. [1.5 Mark] D. Calculate the size of the cache. [1.5 Marks]

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

Database Concepts

Authors: David M. Kroenke

1st Edition

0130086509, 978-0130086501

More Books

Students also viewed these Databases questions