On Fri, Sep 14, 2012 at 07:52:10AM +0200, Ingo Molnar wrote:
Without repeatable hard numbers such code just gets into the
kernel and bitrots there as new CPU generations come in - a few
years down the line the original decisions often degrade to pure
noise. We've been there, we've done
Hi Kirill,
On Tue, Sep 25, 2012 at 05:27:03PM +0300, Kirill A. Shutemov wrote:
On Fri, Sep 14, 2012 at 07:52:10AM +0200, Ingo Molnar wrote:
Without repeatable hard numbers such code just gets into the
kernel and bitrots there as new CPU generations come in - a few
years down the line the
On Mon, 20 Aug 2012 16:52:29 +0300
Kirill A. Shutemov kirill.shute...@linux.intel.com wrote:
Clearing a 2MB huge page will typically blow away several levels of CPU
caches. To avoid this only cache clear the 4K area around the fault
address and use a cache avoiding clears for the rest of the
* Andrew Morton a...@linux-foundation.org wrote:
On Mon, 20 Aug 2012 16:52:29 +0300
Kirill A. Shutemov kirill.shute...@linux.intel.com wrote:
Clearing a 2MB huge page will typically blow away several levels of CPU
caches. To avoid this only cache clear the 4K area around the fault
Hi,
Any feedback?
--
Kirill A. Shutemov
signature.asc
Description: Digital signature
___
Linuxppc-dev mailing list
Linuxppc-dev@lists.ozlabs.org
https://lists.ozlabs.org/listinfo/linuxppc-dev
From: Kirill A. Shutemov kirill.shute...@linux.intel.com
Clearing a 2MB huge page will typically blow away several levels of CPU
caches. To avoid this only cache clear the 4K area around the fault
address and use a cache avoiding clears for the rest of the 2MB area.
This patchset implements
