edited by
290 views
1 votes
1 votes

In Block Replacement techniques, which one leads to poor performance when accesses are made to sequential elements of an Array that is slightly too large to fit into the cache?

  1. $\text{F.I.F.O}$
  2. $\text{L.I.F.O}$
  3. $\text{L.R.U}$
  4. Optimal
edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
elakashi sharma asked Apr 27, 2017
307 views
How we replace blocks in k-way set associative cache ? What strategy we follow?
3 votes
3 votes
1 answer
2
gate_forum asked Nov 6, 2015
434 views
can cache block replacement and page replacement activities clash with each other?