Click here to Skip to main content
15,884,913 members
Please Sign up or sign in to vote.
0.00/5 (No votes)
See more:
I want some source for cache replacement policy such as
• 1 Pseudo-LRU
• 2 Random Replacement
• 3 Segmented LRU
• 4 Low Inter-reference Recency Set
...
can anyone help me?
Posted
Comments
[no name] 17-Mar-13 18:44pm    
What have you tried? This is not a question or a description of any kind of a problem.
Coder93 17-Mar-13 18:56pm    
I have searched about it, but i want to know is there any book or article or ... that gathered some of these algorithms !
[no name] 17-Mar-13 20:10pm    
If you "searched" then you would have found what you are looking for.

1 solution

As always Google is your friend:
Pseudo-LRU[^]
Random Replacement[^]
Segmented LRU[^]
Low Inter-reference Recency Set[^]

Regards
Espen Harlinn
 
Share this answer
 
Comments
Coder93 17-Mar-13 18:57pm    
I had searched about it, but i want to know is there any book or article or ... that gathered some of these algorithms !
Espen Harlinn 17-Mar-13 19:07pm    
Start here:http://en.wikipedia.org/wiki/Cache_algorithms
There are usually references to books and papers, but you may have to browse for a few minutes before you find what you are looking for. IEEE also have a lot on this kind of stuff, but you need to be a member.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900