retagged by
251 views
0 votes
0 votes
A byte-addressable system with 16-bit addresses ships with a three-way set associative, write-back cache (i.e., each block needs a dirty bit). The cache implements a true LRU replacement policy using the minimum number of replacement policy bits necessary to implement it, which means it requires 3 bits per set. The tag store requires a total of 264 bits of storage. What is the block size of the cache? (Hint: 264 = 2^8 + 2^3 and please also do not forget that aside from the tag itself, each block needs 1 valid bit, 1 dirty bit).
retagged by

Please log in or register to answer this question.

Related questions

1.3k
views
0 answers
0 votes
Sandy Sharma asked Dec 20, 2018
1,281 views
A 32-bit wide main memory unit with a capacity of 1 GB is built using 256M 4-bit DRAM chips. The number of rows of memory cells in ... the time available for performing the memory read/write operations in the main memory unit is______%
405
views
1 answers
1 votes
Aspi R Osa asked Jan 16, 2016
405 views
Q. are all these equal?Cache line size = Main memory block size = Virtual Memory Page size = Main memory Frame size?please clear the confusion between both these processes, whether they occur simultaneously or not and how?
437
views
1 answers
2 votes
lovish_bhatia asked Aug 13, 2023
437 views
consider a system which supports 2-address, 1-address and 0-address instruction. the system has 'i' bits addresses. if there are 'x' 2-addresses ... 1-addresses. then what is maximum number of 0-addresses instructions supported by system