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
Give example of stack using encapsulation of OOA An example of the Stack.  A Stack abstraction provides methods like pop (), push (), isEmpty(), isFull(). The Stack can be i

deque insertion and deletion ..

Explain Lexical substitution during macro expansion ? Lexical substitution is used to produce an assembly statement from a model statement. Model statements have 3 kinds of str

Q. Describe Critical Directive in FORTAN? The critical directive permits one thread executes associated structured block. When one or more threads attain critical directive the

Explain The while loop in C The while loop keeps repeating an action until an associated test returns false. This is useful where the programmer does not know in advance how ma

Given memory partitions of 100k, 500k, 200k, 300k, and 600k (in order), apply first fit and best fit algorithms to place processes with the space requirement of 212k, 417k, 112k an

Eequivalences rules: This conveys a meaning that is actually much simpler so than you would think on first inspection.  Hence we can justify this, by using the following ch

Q. Describe the Limitation of FAT16? DOS designers decided to use clusters with as a minimum four sectors in them (so a cluster size of at least 2KB) for all FAT16 hard disks.

Illustrate some notations of object modeling notations A classifier is a mechanism which describes behavioural and structural features. In UML significant classifiers are cla

draw the flowchart for operator overloading in c++