>> However it risks reintroducing the problem addressed by commit 7e9cd4842>> (fix reclaim scalability problem by ignoring the referenced bit,>> mainly the pte young bit). I wonder if there are better solutions?

Agreed, we need to figure out what the real problem is,and how to solve it better.

> Jeff, do you see the refaults on Nehalem systems? If so, that's likely > due to the lack of an accessed bit on EPT pagetables. It would be > interesting to compare with Barcelona (which does).

Not having a hardware accessed bit would explain whythe VM is not reactivating the pages that were accessedwhile on the inactive list.

> If that's indeed the case, we can have the EPT ageing mechanism give > pages a bit more time around by using an available bit in the EPT PTEs > to return accessed on the first pass and not-accessed on the second.

Can we find out which pages are EPT pages?

If so, we could unmap them when they get moved from theactive to the inactive list, and soft fault them back inon access, emulating the referenced bit for EPT pages andmaking page replacement on them work like it should.

Your approximation of pretending the page is accessed thefirst time and pretending it's not the second time soundslike it will just lead to less efficient FIFO replacement,not to anything even vaguely approximating LRU.