Reply-To: kernel-hardening@lists.openwall.com Sender: Ingo Molnar Date: Fri, 28 Oct 2016 11:35:47 +0200 From: Ingo Molnar Message-ID: <20161028093547.GA9291@gmail.com> References: <20161026204748.GA11177@amd> <20161027082801.GE3568@worktop.programming.kicks-ass.net> <20161027091104.GB19469@amd> <20161027093334.GK3102@twins.programming.kicks-ass.net> <20161027212747.GA18147@amd> <20161028070701.GA11376@gmail.com> <20161028085039.GA15032@amd> <20161028090423.GY3102@twins.programming.kicks-ass.net> MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: Subject: [kernel-hardening] Re: rowhammer protection [was Re: Getting interrupt every million cache misses] To: Vegard Nossum Cc: Peter Zijlstra , Pavel Machek , Kees Cook , Arnaldo Carvalho de Melo , kernel list , Ingo Molnar , Alexander Shishkin , "kernel-hardening@lists.openwall.com" List-ID: * Vegard Nossum wrote: > Would it make sense to sample the counter on context switch, do some > accounting on a per-task cache miss counter, and slow down just the > single task(s) with a too high cache miss rate? That way there's no > global slowdown (which I assume would be the case here). The task's > slice of CPU would have to be taken into account because otherwise you > could have multiple cooperating tasks that each escape the limit but > taken together go above it. Attackers could work this around by splitting the rowhammer workload between multiple threads/processes. I.e. the problem is that the risk may come from any 'unprivileged user-space code', where the rowhammer workload might be spread over multiple threads, processes or even users. Thanks, Ingo