Replacement policy - cache memories , Computer Engineering

Replacement policy:

On a particular cache miss we require to evict a line to build room for the new line

"In an A-way set associative cache, we have A option of which block to evict

"Which block will be booted out?

! random

! least-recently utilized (true LRU is too costly)

! pseudo LRU (about LRU - in case of 4-way set associatively 1 bit keeps track of which pair of blocks is LRU, and then tracking which of the block in per pair is LRU (one bit per pair))

! fixed (processing audio stream)

For a 2-way set associative cache, random replacement has a miss rate approximate

1.1 time greater than LRU replacement. As the caches turn into larger, the miss rate for both replacement strategies drop, and the difference becomes little.

Random replacement is sometimes more better than effortless LRU approximations that may be easily implemented in hardware.

 

Posted Date: 10/13/2012 5:28:47 AM | Location : United States







Related Discussions:- Replacement policy - cache memories , Assignment Help, Ask Question on Replacement policy - cache memories , Get Answer, Expert's Help, Replacement policy - cache memories Discussions

Write discussion on Replacement policy - cache memories
Your posts are moderated
Related Questions
Define in brief about the Database Management Systems Databases (Database Management Systems - DBMS) Databases are used to organise and collect information. Most databas

And-Introduction: In generally English says that "if we know that a lot of things are true, so we know that the conjunction of all of them is true", then we can introduce conj


Assume that you are working in a software company as a programmer and a bank is your company's client. The Bank is a most popular and one of the leading banks in Malaysia. Your

What is meant by super scalar processor?  Super scalar processors are designed to exploit more instruction level parallelism in user programs. This means that multiple function

In a simple paging system, what information is stored in a typical Look-aside Buffers  TLB table entry? A classical TLB table entry contains page# and frame#, while a logical

Cutoff Search : To require a mini and max search in a game on stage situation is, in which all we have is just do that programme our agent to look at the intact that search tr

Fifth Generation (1984-1990) The advancement of the next generation of computer systems is characterized majorly by the acceptance of parallel processing.  Until this time para

How is EISA bus different from ISA bus? Extended Industry Standard Architecture (EISA) is a 32 bit modification to ISA bus. As computers became larger and had wider data buses,