Click here to Skip to main content
Rate this: bad
good
Please Sign up or sign in to vote.
See more: Algorithms Cache
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 17-Mar-13 13:12pm
Coder93445
Comments
ThePhantomUpvoter at 17-Mar-13 18:44pm
   
What have you tried? This is not a question or a description of any kind of a problem.
Coder93 at 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 !
ThePhantomUpvoter at 17-Mar-13 20:10pm
   
If you "searched" then you would have found what you are looking for.

1 solution

Rate this: bad
good
Please Sign up or sign in to vote.

Solution 1

As always Google is your friend:
Pseudo-LRU[^]
Random Replacement[^]
Segmented LRU[^]
Low Inter-reference Recency Set[^]
 
Regards
Espen Harlinn
  Permalink  
Comments
Coder93 at 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 at 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)

  Print Answers RSS
0 OriginalGriff 299
1 Maciej Los 295
2 Sergey Alexandrovich Kryukov 230
3 Aajmot Sk 191
4 Sinisa Hajnal 166
0 OriginalGriff 7,760
1 Sergey Alexandrovich Kryukov 7,072
2 DamithSL 5,604
3 Manas Bhardwaj 4,986
4 Maciej Los 4,785


Advertise | Privacy | Mobile
Web01 | 2.8.1411023.1 | Last Updated 17 Mar 2013
Copyright © CodeProject, 1999-2014
All Rights Reserved. Terms of Service
Layout: fixed | fluid

CodeProject, 503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada +1 416-849-8900 x 100