Return-Path: Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id S1758498AbcDMBuW (ORCPT ); Tue, 12 Apr 2016 21:50:22 -0400 Received: from mga02.intel.com ([134.134.136.20]:63805 "EHLO mga02.intel.com" rhost-flags-OK-OK-OK-OK) by vger.kernel.org with ESMTP id S1758456AbcDMBuV (ORCPT ); Tue, 12 Apr 2016 21:50:21 -0400 X-ExtLoop1: 1 X-IronPort-AV: E=Sophos;i="5.24,477,1455004800"; d="scan'208";a="84079446" Date: Wed, 13 Apr 2016 02:07:54 +0800 From: Yuyang Du To: Juri Lelli Cc: peterz@infradead.org, mingo@kernel.org, linux-kernel@vger.kernel.org, bsegall@google.com, pjt@google.com, morten.rasmussen@arm.com, vincent.guittot@linaro.org, dietmar.eggemann@arm.com Subject: Re: [PATCH 1/4] sched/fair: Optimize sum computation with a lookup table Message-ID: <20160412180754.GJ8697@intel.com> References: <1460327765-18024-1-git-send-email-yuyang.du@intel.com> <1460327765-18024-2-git-send-email-yuyang.du@intel.com> <20160411104128.GB14134@e106622-lin> <20160411191210.GF8697@intel.com> <20160412101413.GC5609@e106622-lin> MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: <20160412101413.GC5609@e106622-lin> User-Agent: Mutt/1.5.21 (2010-09-15) Sender: linux-kernel-owner@vger.kernel.org List-ID: X-Mailing-List: linux-kernel@vger.kernel.org Content-Length: 2104 Lines: 61 On Tue, Apr 12, 2016 at 11:14:13AM +0100, Juri Lelli wrote: > On 12/04/16 03:12, Yuyang Du wrote: > > On Mon, Apr 11, 2016 at 11:41:28AM +0100, Juri Lelli wrote: > > > Hi, > > > > > > On 11/04/16 06:36, Yuyang Du wrote: > > > > __compute_runnable_contrib() uses a loop to compute sum, whereas a > > > > table loopup can do it faster in a constant time. > > > > > > > > The following python script can be used to generate the constants: > > > > > > > > print " #: yN_inv yN_sum" > > > > print "-----------------------" > > > > y = (0.5)**(1/32.0) > > > > x = 2**32 > > > > xx = 1024 > > > > for i in range(0, 32): > > > > if i == 0: > > > > x = x-1 > > > > xx = xx*y > > > > else: > > > > x = x*y > > > > xx = int(xx*y + 1024*y) > > > > print "%2d: %#x %8d" % (i, int(x), int(xx)) > > > > > > > > print " #: sum_N32" > > > > print "------------" > > > > xxx = xx > > > > for i in range(0, 11): > > > > if i == 0: > > > > xxx = xx > > > > else: > > > > xxx = xxx/2 + xx > > > > print "%2d: %8d" % (i, xxx) > > > > > > > > > > Thanks for the script, really useful. Do you think there is value in > > > making it general? Like if we want to play with/need changing LOAD_AVG_ > > > PERIOD in the future to something different than 32. > > > > i think a s/32/xx/ should work. > > > > > Also, does the following assume LOAD_AVG_PERIOD == 32? And if yes, do > > > you think there is any value in removing that assumption? > > > > Like Peter said, we are heavily dependent on it already. > > But I think the current code should still work if we define LOAD_AVG_ > PERIOD as, say, 16 and we use Paul's program to recompute the tables. > > My point was about trying to keep everything related to LOAD_AVG_PERIOD > and not start assuming it is 32. I'm not saying your changes assume > that, I was asking if they do. Oh, then my changes do not make more or less dependency. The entire avg thing should only have two seeds (and all others depend on them): (1) a period is 1024*1024ns (2) a half-life is 32 periods I'll check if there is anything hard-coded other than the two.