Hello, dear friend, you can consult us at any time if you have any questions, add WeChat: daixieit

Memory Hierarchy

CISC 221 - Assignment 5

Due: December 4, 2023, 11:59pm

72h – Grace Period

1. (2 marks; note: 1MB = 1024×1024B)

Suppose that a 2 MB file consisting of 512-byte logical blocks is stored on a disk drive with the following characteristics:

For each case below, suppose that a program reads the logical blocks of the file sequentially, one after the other, and that the time to position the head over the first block is Tavg seek+Tavg rotation

A. Best case: Estimate the optimal time (in ms) required to read the file given the best possible mapping of logical blocks to disk sectors (i.e., sequential).

B. Random case: Estimate the time (in ms) required to read the file if blocks are mapped randomly to disk sectors.

2. (4 marks)

The following table gives the parameters for a number of different caches. For each cache, fill in the missing fields in the table. Recall that m is the number of physical address bits, C is the cache size (number of data bytes), B is the block size in bytes, E is the associativity, S is the number of cache sets, r is the number of tag bits, s is the number of set index bits, and b is the number of block offset bits.

3. (2 marks)

This problem concerns the cache in Practice Problem 6.12.

A.  List all of the hex memory addresses that will hit in set 1.

B. List all of the hex memory addresses that will hit in set 6.

Deliverables

To OnQ:

1. Single PDF file for all questions.