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
One might argue that in general processes are more ?exible than threads. For one thing, they can live in two different machines, and communicate via sockets; they are easy to spawn

What are prefetch instructions? Prefetch instructions are those instructions which can be inserted into a program either by the programmer or by the compiler.

In this portion you would see how to put tables in your web documents. It isn't that a table is simply a combination of rows and columns. If you have ever seen any table in an attr


Automatic Stock Control System in a Supermarket -  Bar codes are associated to all goods/items sold by the supermarket as a means of identification -  Every bar code is asso

The hybrid models are mostly tailormade models suiting to exact applications. Actually these fall in the category of mixed models. Such type of application-oriented models keep cro

write about operator precedence in java?

What is linear bounded automation?   A linear bounded automation is restricted type of Turing machine where in the tape head isn't permitted to move off the portion of the tape

Q. Write a Menu driven program to convert the given Decimal number into Binary, Octal and Hexadecimal number. (Fractional numbers are allowed)

Open a LOCAL MACHINE window and type: xhost +ashland # Add the following code sequence just before the plot command that was giving you problems: figure; set(gcf,'renderer','zbuffe