From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from psmtp.com (na3sys010amx162.postini.com [74.125.245.162]) by kanga.kvack.org (Postfix) with SMTP id A8E736B0062 for ; Mon, 2 Jul 2012 03:43:54 -0400 (EDT) Received: by dakp5 with SMTP id p5so8588567dak.14 for ; Mon, 02 Jul 2012 00:43:54 -0700 (PDT) Message-ID: <4FF15128.1030006@gmail.com> Date: Mon, 02 Jul 2012 15:43:36 +0800 From: Nai Xia Reply-To: nai.xia@gmail.com MIME-Version: 1.0 Subject: Re: [PATCH 13/40] autonuma: CPU follow memory algorithm References: <1340888180-15355-1-git-send-email-aarcange@redhat.com> <1340888180-15355-14-git-send-email-aarcange@redhat.com> <1340895238.28750.49.camel@twins> <20120629125517.GD32637@gmail.com> <4FEDDD0C.60609@redhat.com> <1340995986.28750.114.camel@twins> <20120630012338.GY6676@redhat.com> <4FEE9310.1050908@redhat.com> <4FF14DDF.8000201@redhat.com> In-Reply-To: <4FF14DDF.8000201@redhat.com> Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Sender: owner-linux-mm@kvack.org List-ID: To: Rik van Riel Cc: dlaor@redhat.com, Andrea Arcangeli , Peter Zijlstra , Ingo Molnar , Hillf Danton , linux-kernel@vger.kernel.org, linux-mm@kvack.org, Dan Smith , Linus Torvalds , Andrew Morton , Thomas Gleixner , Ingo Molnar , Paul Turner , Suresh Siddha , Mike Galbraith , "Paul E. McKenney" , Lai Jiangshan , Bharata B Rao , Lee Schermerhorn , Johannes Weiner , Srivatsa Vaddagiri , Christoph Lameter , Alex Shi , Mauricio Faria de Oliveira , Konrad Rzeszutek Wilk , Don Morris , Benjamin Herrenschmidt On 2012a1'07ae??02ae?JPY 15:29, Rik van Riel wrote: > On 06/30/2012 04:23 AM, Nai Xia wrote: > >> Oh, sorry, I think I forgot few last comments in my last post: >> >> In case you really can take my advice and do comprehensive research, >> try to make sure that you compare the result of your fancy sampling algorithm >> with this simple logic: >> >> "Blindly select a node and bind the process and move all pages to it." >> >> Stupid it may sound, I highly suspect it can approach the benchmarks >> you already did. >> >> If that's really the truth, then all the sampling and weighting stuff can >> be cut off. > > All the sampling and weighing is there in order to deal with > processes that do not fit in one NUMA node. > > This could be either a process that uses more memory than > what fits in one NUMA node, or a process with more threads > than there are processors in a NUMA node, or both. > > That is what the complex code is for. > Quote Andrea's words:"fully converge the load into one node (or as fewer nodes as possible)". And I think I've said several times this weight is actually W = x * y form. I think I've made my points clear. Well, if you insist, I will keep silence. -- To unsubscribe, send a message with 'unsubscribe linux-mm' in the body to majordomo@kvack.org. For more info on Linux MM, see: http://www.linux-mm.org/ . Don't email: email@kvack.org