Search: in
Pseudo-LRU
Pseudo-LRU Encyclopedia
  Tutorials     Encyclopedia     Dictionary     Directory  
Pseudo-LRU Email this to a friend      Pseudo-LRU


Pseudo-LRU

Pseudo-LRU (also known as Tree-LRU, LRU meaning least recently used) is an efficient algorithm to find an item that most likely has not been accessed very recently, given a set of items and a sequence of access events to the items. This technique is used in the CPU cache of the Intel 486 and in many processors in the Power Architecture (formerly PowerPC) family, such as Freescale's PowerPC G4 used by Apple Computer.

The algorithm works as follows: consider a binary search tree for the items in question. Each node of the tree has a one-bit flag denoting "go left to find a pseudo-LRU element" or "go right to find a pseudo-LRU element". To find a pseudo-LRU element, traverse the tree according to the values of the flags. To update the tree with an access to an item N, traverse the tree to find N and, during the traversal, set the node flags to denote the direction that is opposite to the direction taken.

See also





Source: Wikipedia | The above article is available under the GNU FDL. | Edit this article


Search for Pseudo-LRU in Tutorials
Search for Pseudo-LRU in Encyclopedia
Search for Pseudo-LRU in Dictionary
Search for Pseudo-LRU in Open Directory
Search for Pseudo-LRU in Store
Search for Pseudo-LRU in PriceGig


Help build the largest human-edited directory on the web.
Submit a Site - Open Directory Project - Become an Editor

Advertisement

Advertisement



Pseudo-LRU
Pseudo-LRU top Pseudo-LRU

Home - Add TutorGig to Your Site - Disclaimer

©2008-2009 TutorGig.com. All Rights Reserved. Privacy Statement