Defending against page-cache attacks

https://cartesianproduct.wordpress.com/2011/09/15/done-an...

> The report was on “applying working set heuristics to the Linux kernel“: essentially testing to see if there were ways to overlay some elements of local page replacement to the kernel’s global page replacement policy that would speed turnaround times.

> The answer to that appears to be ‘no’ – at least not in the ways I attempted, though I think there may be some ways to improve performance if some serious studies of phases of locality in programs gave us a better understanding of ways to spot the end of one phase and the beginning of another.

> But, generally speaking, my work showed the global LRU policy of the kernel was pretty robust.