What is the difference between the nru and lru cache

Sign In. Don't have an account? Register now. Sign In using. Already a user? Sign in to JobBuzz. Please enter a valid email id. Password mandatory!

Forgot password? Not you? Not using TJ? Create Account. Already a User? Old Fashioned? Sign In using. Already a user? Sign in to JobBuzz. Please enter a valid email id.

Password mandatory! Forgot password? Not you? Not using TJ? Create Account. Already a User? Old Fashioned? Sign Up Using Email. Display Name mandatory! Email Please enter a valid email id. At least 6 characters required. For four-way and eight-way associativity, binary tree pseudo-LRU is commonly used, though some embedded systems might implement true LRU as such is easier to analyze for worst-case execution time.

For a fully associative TLB, true LRU is less expensive because there is only one set, so storage and control logic can be bundled together. It should also be remembered that LRU is really just an estimate of relative reuse distance; approximation of a conceptually-derived heuristic can be roughly as effective as the ideal heuristic.

Sign up to join this community. The best answers are voted up and rise to the top. Stack Overflow for Teams — Collaborate and share knowledge with a private group. Create a free Team What is Teams? Learn more. What is the difference between LRU implemented for a cache and for page replacement?

Ask Question. Asked 7 years, 5 months ago. Active 7 years, 5 months ago. Viewed 4k times.