sled
sled copied to clipboard
fold the Lru linked list into the PageTable
A key piece of complexity in Caffeine is the need to have a concurrent hashmap for maintaining the logical linked lists. sled currently uses an allocation-heavy doubly-linked-list. sled already has a wait-free 2-level pagetable that we can use instead.