Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

1. Consider one direct mapped cache with four sectors holding one block per sector and one 32-bit word per block. The machine is byte addressed

1. Consider one direct mapped cache with four sectors holding one block per sector and one 32-bit word per block. The machine is byte addressed on word boundaries and uses write allocation with write back.

For each of the following cache accesses, is it a hit or miss? If it is a miss, identify the type of miss (compulsory, capacity, or conflict miss). Assume the cache starts out completely invalidated.

read 0x00

read 0x04

write 0x08

read 0x10

read 0x08

write 0x00

2. Cache hierarchy

You are building a computer system with in-order execution that runs at 1 GHz and has a CPI of 1, with no memory accesses. The memory system is a split L1 cache. Both the I-cache and the D-cache are direct mapped and hold 32 KB each, with a block size of 64 bytes.

The memory system is split L1 cache. Both the I-cache and the D-cache are direct mapped and hold 32 KB each, with a block size of 64 bytes.

The I-cache has a 2% miss rate, and the D-cache is a write-through with 5% miss rate.

The hit cycles for both the I-cache and the D-cache take 1 cycle (1 cycle takes 1 ns).

The L2 cache is a unified write-back with a total size of 512 KB and a block size of 64 bytes.

The hit cycle of the L2 cache is 15 cycles. The local hit rate of the L2 cache is 80%.

An L2 data write miss takes extra 15 ns.

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 Design For Mere Mortals

Authors: Michael J Hernandez

4th Edition

978-0136788041

More Books

Students also viewed these Databases questions