Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Pseudo-LRU

Optimization Algorithm

Pseudo-LRU, or PLRU, is a family of cache replacement algorithms that improve on the Least Recently Used algorithm by replacing values using approximate measures of age rather than tracking the exact age of every cached value. It usually means two designs. Tree-PLRU keeps a one-bit direction flag at each node of a binary tree over the items; finding a victim follows the flags, and each access flips the flags along its path to point away from the item used. It has been used in the CPU cache of the Intel 486 and in many PowerPC processors, and as an approximation it can pick a slightly wrong victim. Bit-PLRU keeps one recently-used bit per cache line and resets the other bits when the last zero bit is set.

Facts
Problem Solved
cache replacement 1
Connections

In Field

Source Pseudo-LRU (Wikipedia)

Uses Design Technique

Source Pseudo-LRU (Wikipedia)
Sources
1. Pseudo-LRU (Wikipedia)
  • Lead, problem solved
    Pseudo-LRU or PLRU is a family of cache algorithms which improve on the performance of the Least Recently Used (LRU) algorithm
  • In Field: Computer Architecture, Tree-PLRU
    This technique is used in the CPU cache of the Intel 486 and in many processors in the PowerPC family
  • Uses Design Technique: Approximation Algorithms, Lead
    by replacing values using approximate measures of age rather than maintaining the exact age of every value in the cache
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.