From mboxrd@z Thu Jan 1 00:00:00 1970 From: Ingo Molnar Subject: Re: [PATCH] sched: remove sched_find_first_bit() Date: Tue, 16 May 2017 10:30:42 +0200 Message-ID: <20170516083042.ybenukaiiwevgqph@gmail.com> References: <20170513010152.13986-1-ynorov@caviumnetworks.com> <20170514180917.bil7xr4bqtfk6fzj@gmail.com> <20170515154728.amzw3d67tw722wmu@yury-N73SV> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Return-path: Received: from mail-wm0-f65.google.com ([74.125.82.65]:33273 "EHLO mail-wm0-f65.google.com" rhost-flags-OK-OK-OK-OK) by vger.kernel.org with ESMTP id S1751550AbdEPIaq (ORCPT ); Tue, 16 May 2017 04:30:46 -0400 Content-Disposition: inline In-Reply-To: <20170515154728.amzw3d67tw722wmu@yury-N73SV> Sender: linux-arch-owner@vger.kernel.org List-ID: To: Yury Norov Cc: linux-arch@vger.kernel.org, linux-kernel@vger.kernel.org, Arnd Bergmann , Ingo Molnar , Peter Zijlstra , Richard Henderson , Ivan Kokshaysky , Matt Turner , Akinobu Mita , Mike Galbraith , Peter Zijlstra * Yury Norov wrote: > I collected about 700 results in dmesg, and took 600 fastest. > For the vanilla kernel, the average value is 368, and for patched > kernel it is 388. It's 5% slower. But the standard deviation is > really big for both series' - 131 and 106 cycles respectively, which > is ~ 30%. And so, my conclusion is: there's no benefit in using > sched_find_first_bit() comparing to find_first_bit(). Erm, so you in essence claim: "according to measurements the new code is 5% slower, with a high, 30% stddev, hence the new code is better!" Basic logic fail... Thanks, Ingo