retagged by
7,766 views
19 votes
19 votes
Consider a set-associative cache of size $\text{2KB (1KB} =2^{10}$ bytes$\text{)}$ with cache block size of $64$ bytes. Assume that the cache is byte-addressable and a $32$ -bit address is used for accessing the cache. If the width of the tag field is $22$ bits, the associativity of the cache is _________
retagged by

5 Answers

0 votes
0 votes
Calculate Tag size in Direct Mapping = MM Size/CM size

MM = 2^32

CM = 2^11

DM TAG = 2^32/2^11 = 2^21 = 21 bit

SET Associative tag  = DM tag + log base 2 N-way

22 = 21 + log base 2 N-way

N-way = 2

that's the answer.

 
Answer:

Related questions

8.4k
views
2 answers
18 votes
Arjun asked Feb 18, 2021
8,392 views
Assume a two-level inclusive cache hierarchy, $L1$ and $L2$, where $L2$ is the larger of the two. Consider the following statements.$S_1$: Read misses in a ... true$S_1$ is true and $S_2$ is true$S_1$ is false and $S_2$ is false
11.9k
views
3 answers
25 votes
Arjun asked Feb 18, 2021
11,886 views
Consider a computer system with $\text{DMA}$ support. The $\text{DMA}$ module is transferring one $8$-bit character in one $\text{CPU}$ cycle from a ... $\text{DMA}$, the data transfer rate of the device is __________ bits per second.
16.1k
views
4 answers
23 votes
Arjun asked Feb 18, 2021
16,149 views
Consider a pipelined processor with $5$ stages, $\text{Instruction Fetch} (\textsf{IF})$, $\text{Instruction Decode} \textsf{(ID)}$ ... instruction sequence on the pipelined processor (rounded to $2$ decimal places) is _____________
11.6k
views
3 answers
14 votes
Arjun asked Feb 18, 2021
11,604 views
Consider a complete binary tree with $7$ nodes. Let $A$ denote the set of first $3$ elements obtained by performing Breadth-First Search $\text{(BFS)}$ starting ... $\mid A-B \mid $ is _____________