• retagged by
739 views
0 0 votes

A byte addressable computer has a small data cache capable of holding 16 32-bit words. Each cache block consist of four 32 bits words. For the following sequence of main memory addresses (in hexadecimal). The conflict miss if 2-way set associative LRU cache is used is_____

100,108, 114,1C7, 128, 1B5, 100, 108, 1C7

I just want to know what will be the address partition look like. 

1.

tag(7) set(1) offset(4) 

2.

tag(7) set(1) offset(2)

 

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
0 0 answers
882
882 views
pream sagar asked Oct 19, 2018
882 views
Assume that we have three scenariosl. a fully associative cache,2. a two way set associative cache and3. a direct mapped cache.The cache size is 256 bytes. The cache line...
9 9 votes
3 3 answers
5.7k
5.7k views
Sara asked Oct 18, 2015
5,666 views
An 8 byte, 2-way set associative (using LRU replacement) with 2 byte blocks receives requests for the following addresses (represented in binary): 0110, 0000, 0010, 0001,...
2 2 votes
1 answers 1 answer
1.0k
1.0k views
Bikram asked Sep 3, 2016
1,007 views
There is a 4 way set associative cache memory with 8 cache blocks. The main memory consists of 256 blocks and the request for memory blocks is in that order:$$0,255,1,4,3...
0 0 votes
0 0 answers
595
595 views