Exemplary embodiments include a method for updating an Cache LRU tree including: receiving a new cache line; traversing the Cache LRU tree, the Cache LRU tree including a plurality of nodes; biasing a selection the victim line toward those lines with relatively low priorities from the plurality of lines; and replacing a cache line with a relatively low priority with the new cache line.

 
Web www.patentalert.com

< Coordinated dirty block tracking

> Rapid prototyping, generating and dynamically modifying a schema representing a database

> Eager reference-counting garbage collection

~ 00509