Register

Block replacement in cache

• edited by
469 views
1 1 vote

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

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · c-programmingNext → · Size of the ROM
← Previous in category · pipeliningNext in category → · Size of the ROM
Position:
Show:

Related questions

0 0 votes
0 0 answers
604
604 views
elakashi sharma asked Apr 27, 2017
604 views
Block replacement in cache
How we replace blocks in k-way set associative cache ? What strategy we follow?
3 3 votes
1 1 answer
733
733 views
gate_forum asked Nov 6, 2015
733 views
clash of cache block replacement and page replacement
can cache block replacement and page replacement activities clash with each other?
1 1 vote
1 1 answer
1.7k
1.7k views
Disha asked Sep 26, 2014
1,744 views
an access sequence of cache block address of length N and contaons n unique addresses. The no. of unique block address between 2 consecutive accesses to the same block address is bound above by k. What is miss ratio if access sequence is passed through a cache of associativity A >= k exercising LRU replacement policy? Ans is n/N but how?
0 0 votes
1 1 answer
4.3k
4.3k views
rookoodracula asked Mar 3, 2023
4,298 views
With the help of the following information, determine the size of the sub-fields (in bits) in the address for direct mapping, associative mapping and set-associative mapping:  512 MB main memory and 2 MB cache memory  Address space of the processor is 256 MB  The block size is 256 bytes  There are 16 blocks in a cache set.