Existing eviction algorithm __ in WiredTiger walks the tree to identify LRU pages. Walking the tree is time consuming, error-prone and results in complicated code. This project will prototype a new approach to keeping LRU lists that avoids walking the tree. The cached pages will be kept in approximately sorted order, being inserted and moved between multiple LRU lists as their read generations are updated. Eviction workers will pick pages to evict from the top of LRU lists. This approach was prototyped in a simulator and showed promising results.